./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.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.vis_arrays_vsaR_p01.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 879e24419bd498e1e21caa9587c0e4309307886fe7a917d7b60b20729c232f2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:14:54,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:14:54,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:14:54,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:14:54,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:14:54,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:14:54,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:14:54,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:14:54,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:14:54,102 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:14:54,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:14:54,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:14:54,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:14:54,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:14:54,103 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:14:54,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:14:54,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:14:54,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:14:54,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:14:54,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:14:54,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:14:54,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:14:54,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:14:54,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:14:54,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:14:54,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:14:54,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:14:54,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:14:54,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:14:54,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:14:54,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:14:54,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:14:54,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:14:54,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:14:54,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:14:54,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:14:54,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:14:54,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:14:54,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:14:54,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:14:54,105 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 -> 879e24419bd498e1e21caa9587c0e4309307886fe7a917d7b60b20729c232f2d [2025-02-08 00:14:54,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:14:54,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:14:54,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:14:54,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:14:54,319 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:14:54,320 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.vis_arrays_vsaR_p01.c [2025-02-08 00:14:55,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8671b7827/462237089ef744d592de4c008fdbe7e0/FLAGd6f1a8bc2 [2025-02-08 00:14:55,672 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:14:55,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.c [2025-02-08 00:14:55,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8671b7827/462237089ef744d592de4c008fdbe7e0/FLAGd6f1a8bc2 [2025-02-08 00:14:55,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8671b7827/462237089ef744d592de4c008fdbe7e0 [2025-02-08 00:14:55,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:14:55,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:14:55,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:14:55,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:14:55,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:14:55,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:14:55" (1/1) ... [2025-02-08 00:14:55,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f773c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:55, skipping insertion in model container [2025-02-08 00:14:55,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:14:55" (1/1) ... [2025-02-08 00:14:55,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:14:55,854 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.vis_arrays_vsaR_p01.c[1259,1272] [2025-02-08 00:14:56,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:14:56,036 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:14:56,043 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.vis_arrays_vsaR_p01.c[1259,1272] [2025-02-08 00:14:56,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:14:56,137 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:14:56,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56 WrapperNode [2025-02-08 00:14:56,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:14:56,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:14:56,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:14:56,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:14:56,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,345 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2360 [2025-02-08 00:14:56,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:14:56,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:14:56,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:14:56,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:14:56,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,433 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-08 00:14:56,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:14:56,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:14:56,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:14:56,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:14:56,554 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (1/1) ... [2025-02-08 00:14:56,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:14:56,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:14:56,579 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-08 00:14:56,583 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-08 00:14:56,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:14:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:14:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:14:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:14:56,867 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:14:56,868 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:14:58,626 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2025-02-08 00:14:58,626 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:14:58,707 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:14:58,708 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:14:58,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:14:58 BoogieIcfgContainer [2025-02-08 00:14:58,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:14:58,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:14:58,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:14:58,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:14:58,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:14:55" (1/3) ... [2025-02-08 00:14:58,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68023ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:14:58, skipping insertion in model container [2025-02-08 00:14:58,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:56" (2/3) ... [2025-02-08 00:14:58,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68023ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:14:58, skipping insertion in model container [2025-02-08 00:14:58,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:14:58" (3/3) ... [2025-02-08 00:14:58,715 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p01.c [2025-02-08 00:14:58,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:14:58,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p01.c that has 1 procedures, 585 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:14:58,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:14:58,776 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;@1cdb6308, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:14:58,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:14:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 585 states, 583 states have (on average 1.5008576329331047) internal successors, (875), 584 states have internal predecessors, (875), 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-08 00:14:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 00:14:58,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:58,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:58,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:58,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1524496223, now seen corresponding path program 1 times [2025-02-08 00:14:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:58,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071892890] [2025-02-08 00:14:58,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:58,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 00:14:59,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 00:14:59,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:59,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:59,588 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-08 00:14:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071892890] [2025-02-08 00:14:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071892890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:59,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:59,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030030636] [2025-02-08 00:14:59,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:59,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:14:59,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:59,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:14:59,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:14:59,611 INFO L87 Difference]: Start difference. First operand has 585 states, 583 states have (on average 1.5008576329331047) internal successors, (875), 584 states have internal predecessors, (875), 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 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-08 00:14:59,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:59,941 INFO L93 Difference]: Finished difference Result 1117 states and 1673 transitions. [2025-02-08 00:14:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:14:59,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-02-08 00:14:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:59,954 INFO L225 Difference]: With dead ends: 1117 [2025-02-08 00:14:59,955 INFO L226 Difference]: Without dead ends: 585 [2025-02-08 00:14:59,960 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-08 00:14:59,961 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 0 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:59,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2173 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:14:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-08 00:15:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2025-02-08 00:15:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4965753424657535) internal successors, (874), 584 states have internal predecessors, (874), 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-08 00:15:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 874 transitions. [2025-02-08 00:15:00,014 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 874 transitions. Word has length 62 [2025-02-08 00:15:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:00,014 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 874 transitions. [2025-02-08 00:15:00,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-08 00:15:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 874 transitions. [2025-02-08 00:15:00,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 00:15:00,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:00,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:00,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:15:00,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:00,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:00,020 INFO L85 PathProgramCache]: Analyzing trace with hash -10062707, now seen corresponding path program 1 times [2025-02-08 00:15:00,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:00,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882520442] [2025-02-08 00:15:00,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:00,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:00,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 00:15:00,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 00:15:00,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:00,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:00,288 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-08 00:15:00,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:00,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882520442] [2025-02-08 00:15:00,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882520442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:00,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:00,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:00,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574699661] [2025-02-08 00:15:00,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:00,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:00,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:00,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:00,291 INFO L87 Difference]: Start difference. First operand 585 states and 874 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-08 00:15:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:00,531 INFO L93 Difference]: Finished difference Result 1119 states and 1672 transitions. [2025-02-08 00:15:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:00,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-02-08 00:15:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:00,535 INFO L225 Difference]: With dead ends: 1119 [2025-02-08 00:15:00,535 INFO L226 Difference]: Without dead ends: 587 [2025-02-08 00:15:00,536 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-08 00:15:00,536 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 0 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:00,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2170 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-08 00:15:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2025-02-08 00:15:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 1.4948805460750854) internal successors, (876), 586 states have internal predecessors, (876), 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-08 00:15:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 876 transitions. [2025-02-08 00:15:00,552 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 876 transitions. Word has length 63 [2025-02-08 00:15:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:00,552 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 876 transitions. [2025-02-08 00:15:00,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-08 00:15:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 876 transitions. [2025-02-08 00:15:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 00:15:00,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:00,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:00,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:15:00,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:00,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1619566108, now seen corresponding path program 1 times [2025-02-08 00:15:00,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:00,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129006098] [2025-02-08 00:15:00,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:00,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:00,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 00:15:00,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 00:15:00,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:00,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:01,001 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-08 00:15:01,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129006098] [2025-02-08 00:15:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129006098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:01,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:01,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:01,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912699287] [2025-02-08 00:15:01,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:01,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:01,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:01,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:01,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:01,003 INFO L87 Difference]: Start difference. First operand 587 states and 876 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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-08 00:15:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:01,289 INFO L93 Difference]: Finished difference Result 1125 states and 1679 transitions. [2025-02-08 00:15:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:01,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-02-08 00:15:01,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:01,292 INFO L225 Difference]: With dead ends: 1125 [2025-02-08 00:15:01,292 INFO L226 Difference]: Without dead ends: 591 [2025-02-08 00:15:01,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:01,293 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 822 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:01,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2144 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-02-08 00:15:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 590. [2025-02-08 00:15:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.4923599320882852) internal successors, (879), 589 states have internal predecessors, (879), 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-08 00:15:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 879 transitions. [2025-02-08 00:15:01,312 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 879 transitions. Word has length 64 [2025-02-08 00:15:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:01,313 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 879 transitions. [2025-02-08 00:15:01,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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-08 00:15:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 879 transitions. [2025-02-08 00:15:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 00:15:01,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:01,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:01,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:15:01,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:01,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:01,317 INFO L85 PathProgramCache]: Analyzing trace with hash 555305106, now seen corresponding path program 1 times [2025-02-08 00:15:01,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:01,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349774024] [2025-02-08 00:15:01,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:01,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:01,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 00:15:01,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 00:15:01,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:01,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:01,554 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-08 00:15:01,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:01,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349774024] [2025-02-08 00:15:01,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349774024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:01,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:01,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:01,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893986298] [2025-02-08 00:15:01,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:01,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:01,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:01,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:01,556 INFO L87 Difference]: Start difference. First operand 590 states and 879 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-08 00:15:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:01,775 INFO L93 Difference]: Finished difference Result 1129 states and 1682 transitions. [2025-02-08 00:15:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:01,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2025-02-08 00:15:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:01,781 INFO L225 Difference]: With dead ends: 1129 [2025-02-08 00:15:01,781 INFO L226 Difference]: Without dead ends: 592 [2025-02-08 00:15:01,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:01,782 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 0 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:01,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2170 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-08 00:15:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-02-08 00:15:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.490693739424704) internal successors, (881), 591 states have internal predecessors, (881), 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-08 00:15:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 881 transitions. [2025-02-08 00:15:01,794 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 881 transitions. Word has length 65 [2025-02-08 00:15:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:01,794 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 881 transitions. [2025-02-08 00:15:01,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-08 00:15:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 881 transitions. [2025-02-08 00:15:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 00:15:01,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:01,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:01,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:15:01,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:01,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1323777675, now seen corresponding path program 1 times [2025-02-08 00:15:01,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:01,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977265301] [2025-02-08 00:15:01,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:01,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:01,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 00:15:01,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 00:15:01,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:01,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:01,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:15:02,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 00:15:02,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 00:15:02,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:02,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:02,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:15:02,220 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:15:02,220 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:15:02,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:15:02,224 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 00:15:02,280 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:15:02,300 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:15:02,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:15:02 BoogieIcfgContainer [2025-02-08 00:15:02,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:15:02,304 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:15:02,304 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:15:02,304 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:15:02,305 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:14:58" (3/4) ... [2025-02-08 00:15:02,307 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:15:02,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:15:02,308 INFO L158 Benchmark]: Toolchain (without parser) took 6609.89ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 128.3MB in the beginning and 177.6MB in the end (delta: -49.3MB). Peak memory consumption was 99.5MB. Max. memory is 16.1GB. [2025-02-08 00:15:02,309 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:15:02,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.35ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 79.6MB in the end (delta: 48.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 00:15:02,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 206.84ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 79.6MB in the beginning and 101.4MB in the end (delta: -21.7MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2025-02-08 00:15:02,309 INFO L158 Benchmark]: Boogie Preprocessor took 205.68ms. Allocated memory is still 176.2MB. Free memory was 101.4MB in the beginning and 72.4MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 00:15:02,310 INFO L158 Benchmark]: IcfgBuilder took 2156.00ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 72.4MB in the beginning and 137.0MB in the end (delta: -64.6MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. [2025-02-08 00:15:02,310 INFO L158 Benchmark]: TraceAbstraction took 3593.13ms. Allocated memory was 260.0MB in the beginning and 318.8MB in the end (delta: 58.7MB). Free memory was 137.0MB in the beginning and 177.6MB in the end (delta: -40.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-02-08 00:15:02,310 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 318.8MB. Free memory was 177.6MB in the beginning and 177.6MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:15:02,312 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.89ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.35ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 79.6MB in the end (delta: 48.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 206.84ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 79.6MB in the beginning and 101.4MB in the end (delta: -21.7MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 205.68ms. Allocated memory is still 176.2MB. Free memory was 101.4MB in the beginning and 72.4MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 2156.00ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 72.4MB in the beginning and 137.0MB in the end (delta: -64.6MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3593.13ms. Allocated memory was 260.0MB in the beginning and 318.8MB in the end (delta: 58.7MB). Free memory was 137.0MB in the beginning and 177.6MB in the end (delta: -40.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 318.8MB. Free memory was 177.6MB in the beginning and 177.6MB in the end (delta: 25.4kB). 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 297. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 32); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (32 - 1); [L38] const SORT_88 mask_SORT_88 = (SORT_88)-1 >> (sizeof(SORT_88) * 8 - 3); [L39] const SORT_88 msb_SORT_88 = (SORT_88)1 << (3 - 1); [L41] const SORT_115 mask_SORT_115 = (SORT_115)-1 >> (sizeof(SORT_115) * 8 - 2); [L42] const SORT_115 msb_SORT_115 = (SORT_115)1 << (2 - 1); [L44] const SORT_222 mask_SORT_222 = (SORT_222)-1 >> (sizeof(SORT_222) * 8 - 4); [L45] const SORT_222 msb_SORT_222 = (SORT_222)1 << (4 - 1); [L47] const SORT_3 var_7 = 0; [L48] const SORT_1 var_12 = 1; [L49] const SORT_1 var_19 = 0; [L50] const SORT_21 var_23 = 12; [L51] const SORT_21 var_29 = 15; [L52] const SORT_21 var_36 = 8; [L53] const SORT_21 var_42 = 11; [L54] const SORT_21 var_50 = 4; [L55] const SORT_21 var_56 = 7; [L56] const SORT_5 var_83 = 0; [L57] const SORT_88 var_89 = 0; [L58] const SORT_88 var_93 = 2; [L59] const SORT_88 var_97 = 1; [L60] const SORT_88 var_102 = 4; [L61] const SORT_88 var_104 = 5; [L62] const SORT_88 var_108 = 3; [L63] const SORT_21 var_118 = 0; [L64] const SORT_3 var_125 = 31; [L65] const SORT_88 var_313 = 7; [L66] const SORT_88 var_318 = 6; [L67] const SORT_3 var_378 = 2; [L69] SORT_1 input_2; [L70] SORT_3 input_4; [L71] SORT_5 input_6; [L72] SORT_3 input_112; [L73] SORT_3 input_113; [L74] SORT_3 input_114; [L75] SORT_3 input_124; [L76] SORT_3 input_134; [L77] SORT_3 input_135; [L78] SORT_3 input_136; [L79] SORT_3 input_139; [L80] SORT_3 input_158; [L81] SORT_3 input_159; [L82] SORT_3 input_160; [L83] SORT_3 input_163; [L84] SORT_3 input_165; [L85] SORT_115 input_179; [L86] SORT_115 input_180; [L87] SORT_115 input_181; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L89] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L90] SORT_3 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L91] SORT_3 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L92] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L93] SORT_3 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L94] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L95] SORT_3 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L96] SORT_3 state_77 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L97] SORT_3 state_79 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L98] SORT_1 state_81 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L99] SORT_5 state_84 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L100] SORT_3 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L101] EXPR __VERIFIER_nondet_uchar() & mask_SORT_88 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_83=0, var_89=0, var_93=2, var_97=1] [L101] SORT_88 state_90 = __VERIFIER_nondet_uchar() & mask_SORT_88; [L103] SORT_3 init_9_arg_1 = var_7; [L104] state_8 = init_9_arg_1 [L105] SORT_3 init_11_arg_1 = var_7; [L106] state_10 = init_11_arg_1 [L107] SORT_3 init_15_arg_1 = var_7; [L108] state_14 = init_15_arg_1 [L109] SORT_3 init_17_arg_1 = var_7; [L110] state_16 = init_17_arg_1 [L111] SORT_3 init_61_arg_1 = var_7; [L112] state_60 = init_61_arg_1 [L113] SORT_3 init_65_arg_1 = var_7; [L114] state_64 = init_65_arg_1 [L115] SORT_3 init_69_arg_1 = var_7; [L116] state_68 = init_69_arg_1 [L117] SORT_3 init_78_arg_1 = var_7; [L118] state_77 = init_78_arg_1 [L119] SORT_3 init_80_arg_1 = var_7; [L120] state_79 = init_80_arg_1 [L121] SORT_1 init_82_arg_1 = var_19; [L122] state_81 = init_82_arg_1 [L123] SORT_5 init_85_arg_1 = var_83; [L124] state_84 = init_85_arg_1 [L125] SORT_3 init_87_arg_1 = var_7; [L126] state_86 = init_87_arg_1 [L127] SORT_88 init_91_arg_1 = var_89; [L128] state_90 = init_91_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] input_6 = __VERIFIER_nondet_ushort() [L134] input_112 = __VERIFIER_nondet_uchar() [L135] input_113 = __VERIFIER_nondet_uchar() [L136] input_114 = __VERIFIER_nondet_uchar() [L137] input_124 = __VERIFIER_nondet_uchar() [L138] input_134 = __VERIFIER_nondet_uchar() [L139] input_135 = __VERIFIER_nondet_uchar() [L140] input_136 = __VERIFIER_nondet_uchar() [L141] input_139 = __VERIFIER_nondet_uchar() [L142] input_158 = __VERIFIER_nondet_uchar() [L143] input_159 = __VERIFIER_nondet_uchar() [L144] input_160 = __VERIFIER_nondet_uchar() [L145] input_163 = __VERIFIER_nondet_uchar() [L146] input_165 = __VERIFIER_nondet_uchar() [L147] input_179 = __VERIFIER_nondet_uchar() [L148] input_180 = __VERIFIER_nondet_uchar() [L149] input_181 = __VERIFIER_nondet_uchar() [L152] SORT_1 var_18_arg_0 = var_12; [L153] SORT_3 var_18_arg_1 = state_16; [L154] SORT_3 var_18_arg_2 = state_14; [L155] SORT_3 var_18 = var_18_arg_0 ? var_18_arg_1 : var_18_arg_2; [L156] SORT_1 var_13_arg_0 = var_12; [L157] SORT_3 var_13_arg_1 = state_10; [L158] SORT_3 var_13_arg_2 = state_8; [L159] SORT_3 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L160] SORT_1 var_20_arg_0 = var_19; [L161] SORT_3 var_20_arg_1 = var_18; [L162] SORT_3 var_20_arg_2 = var_13; [L163] SORT_3 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L164] SORT_3 var_22_arg_0 = var_20; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_22_arg_0=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L165] EXPR var_22_arg_0 & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L165] var_22_arg_0 = var_22_arg_0 & mask_SORT_3 [L166] SORT_21 var_22 = var_22_arg_0; [L167] SORT_21 var_24_arg_0 = var_22; [L168] SORT_21 var_24_arg_1 = var_23; [L169] SORT_1 var_24 = var_24_arg_0 >= var_24_arg_1; [L170] SORT_1 var_26_arg_0 = var_12; [L171] SORT_3 var_26_arg_1 = state_16; [L172] SORT_3 var_26_arg_2 = state_14; [L173] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L174] SORT_1 var_25_arg_0 = var_12; [L175] SORT_3 var_25_arg_1 = state_10; [L176] SORT_3 var_25_arg_2 = state_8; [L177] SORT_3 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L178] SORT_1 var_27_arg_0 = var_19; [L179] SORT_3 var_27_arg_1 = var_26; [L180] SORT_3 var_27_arg_2 = var_25; [L181] SORT_3 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L182] SORT_3 var_28_arg_0 = var_27; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_24=0, var_28_arg_0=0, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L183] EXPR var_28_arg_0 & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_24=0, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L183] var_28_arg_0 = var_28_arg_0 & mask_SORT_3 [L184] SORT_21 var_28 = var_28_arg_0; [L185] SORT_21 var_30_arg_0 = var_28; [L186] SORT_21 var_30_arg_1 = var_29; [L187] SORT_1 var_30 = var_30_arg_0 <= var_30_arg_1; [L188] SORT_1 var_31_arg_0 = var_24; [L189] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_31_arg_0=0, var_31_arg_1=1, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L190] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L190] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L191] SORT_1 var_33_arg_0 = var_19; [L192] SORT_3 var_33_arg_1 = state_16; [L193] SORT_3 var_33_arg_2 = state_14; [L194] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L195] SORT_1 var_32_arg_0 = var_19; [L196] SORT_3 var_32_arg_1 = state_10; [L197] SORT_3 var_32_arg_2 = state_8; [L198] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L199] SORT_1 var_34_arg_0 = var_12; [L200] SORT_3 var_34_arg_1 = var_33; [L201] SORT_3 var_34_arg_2 = var_32; [L202] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L203] SORT_3 var_35_arg_0 = var_34; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_31=0, var_35_arg_0=0, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L204] EXPR var_35_arg_0 & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_31=0, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L204] var_35_arg_0 = var_35_arg_0 & mask_SORT_3 [L205] SORT_21 var_35 = var_35_arg_0; [L206] SORT_21 var_37_arg_0 = var_35; [L207] SORT_21 var_37_arg_1 = var_36; [L208] SORT_1 var_37 = var_37_arg_0 >= var_37_arg_1; [L209] SORT_1 var_39_arg_0 = var_19; [L210] SORT_3 var_39_arg_1 = state_16; [L211] SORT_3 var_39_arg_2 = state_14; [L212] SORT_3 var_39 = var_39_arg_0 ? var_39_arg_1 : var_39_arg_2; [L213] SORT_1 var_38_arg_0 = var_19; [L214] SORT_3 var_38_arg_1 = state_10; [L215] SORT_3 var_38_arg_2 = state_8; [L216] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L217] SORT_1 var_40_arg_0 = var_12; [L218] SORT_3 var_40_arg_1 = var_39; [L219] SORT_3 var_40_arg_2 = var_38; [L220] SORT_3 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; [L221] SORT_3 var_41_arg_0 = var_40; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_31=0, var_36=8, var_378=2, var_37=0, var_41_arg_0=0, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L222] EXPR var_41_arg_0 & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_31=0, var_36=8, var_378=2, var_37=0, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L222] var_41_arg_0 = var_41_arg_0 & mask_SORT_3 [L223] SORT_21 var_41 = var_41_arg_0; [L224] SORT_21 var_43_arg_0 = var_41; [L225] SORT_21 var_43_arg_1 = var_42; [L226] SORT_1 var_43 = var_43_arg_0 <= var_43_arg_1; [L227] SORT_1 var_44_arg_0 = var_37; [L228] SORT_1 var_44_arg_1 = var_43; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_31=0, var_36=8, var_378=2, var_42=11, var_44_arg_0=0, var_44_arg_1=1, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L229] EXPR var_44_arg_0 & var_44_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_31=0, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L229] SORT_1 var_44 = var_44_arg_0 & var_44_arg_1; [L230] SORT_1 var_45_arg_0 = var_31; [L231] SORT_1 var_45_arg_1 = var_44; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_45_arg_0=0, var_45_arg_1=0, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L232] EXPR var_45_arg_0 & var_45_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L232] SORT_1 var_45 = var_45_arg_0 & var_45_arg_1; [L233] SORT_1 var_47_arg_0 = var_12; [L234] SORT_3 var_47_arg_1 = state_16; [L235] SORT_3 var_47_arg_2 = state_14; [L236] SORT_3 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L237] SORT_1 var_46_arg_0 = var_12; [L238] SORT_3 var_46_arg_1 = state_10; [L239] SORT_3 var_46_arg_2 = state_8; [L240] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L241] SORT_1 var_48_arg_0 = var_12; [L242] SORT_3 var_48_arg_1 = var_47; [L243] SORT_3 var_48_arg_2 = var_46; [L244] SORT_3 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L245] SORT_3 var_49_arg_0 = var_48; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_45=0, var_49_arg_0=0, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L246] EXPR var_49_arg_0 & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_45=0, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L246] var_49_arg_0 = var_49_arg_0 & mask_SORT_3 [L247] SORT_21 var_49 = var_49_arg_0; [L248] SORT_21 var_51_arg_0 = var_49; [L249] SORT_21 var_51_arg_1 = var_50; [L250] SORT_1 var_51 = var_51_arg_0 >= var_51_arg_1; [L251] SORT_1 var_53_arg_0 = var_12; [L252] SORT_3 var_53_arg_1 = state_16; [L253] SORT_3 var_53_arg_2 = state_14; [L254] SORT_3 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L255] SORT_1 var_52_arg_0 = var_12; [L256] SORT_3 var_52_arg_1 = state_10; [L257] SORT_3 var_52_arg_2 = state_8; [L258] SORT_3 var_52 = var_52_arg_0 ? var_52_arg_1 : var_52_arg_2; [L259] SORT_1 var_54_arg_0 = var_12; [L260] SORT_3 var_54_arg_1 = var_53; [L261] SORT_3 var_54_arg_2 = var_52; [L262] SORT_3 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L263] SORT_3 var_55_arg_0 = var_54; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_45=0, var_50=4, var_51=0, var_55_arg_0=0, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L264] EXPR var_55_arg_0 & mask_SORT_3 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_45=0, var_50=4, var_51=0, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L264] var_55_arg_0 = var_55_arg_0 & mask_SORT_3 [L265] SORT_21 var_55 = var_55_arg_0; [L266] SORT_21 var_57_arg_0 = var_55; [L267] SORT_21 var_57_arg_1 = var_56; [L268] SORT_1 var_57 = var_57_arg_0 <= var_57_arg_1; [L269] SORT_1 var_58_arg_0 = var_51; [L270] SORT_1 var_58_arg_1 = var_57; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_45=0, var_50=4, var_56=7, var_58_arg_0=0, var_58_arg_1=1, var_7=0, var_89=0, var_93=2, var_97=1] [L271] EXPR var_58_arg_0 & var_58_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_45=0, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L271] SORT_1 var_58 = var_58_arg_0 & var_58_arg_1; [L272] SORT_1 var_59_arg_0 = var_45; [L273] SORT_1 var_59_arg_1 = var_58; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_59_arg_0=0, var_59_arg_1=0, var_7=0, var_89=0, var_93=2, var_97=1] [L274] EXPR var_59_arg_0 & var_59_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L274] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L275] SORT_3 var_62_arg_0 = state_60; [L276] SORT_3 var_62_arg_1 = var_7; [L277] SORT_1 var_62 = var_62_arg_0 == var_62_arg_1; [L278] SORT_1 var_63_arg_0 = var_59; [L279] SORT_1 var_63_arg_1 = var_62; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_63_arg_0=0, var_63_arg_1=1, var_7=0, var_89=0, var_93=2, var_97=1] [L280] EXPR var_63_arg_0 & var_63_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L280] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L281] SORT_3 var_66_arg_0 = state_64; [L282] SORT_3 var_66_arg_1 = var_7; [L283] SORT_1 var_66 = var_66_arg_0 == var_66_arg_1; [L284] SORT_1 var_67_arg_0 = var_63; [L285] SORT_1 var_67_arg_1 = var_66; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_67_arg_0=0, var_67_arg_1=1, var_7=0, var_89=0, var_93=2, var_97=1] [L286] EXPR var_67_arg_0 & var_67_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L286] SORT_1 var_67 = var_67_arg_0 & var_67_arg_1; [L287] SORT_3 var_70_arg_0 = state_68; [L288] SORT_3 var_70_arg_1 = var_7; [L289] SORT_1 var_70 = var_70_arg_0 == var_70_arg_1; [L290] SORT_1 var_71_arg_0 = var_67; [L291] SORT_1 var_71_arg_1 = var_70; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_71_arg_0=0, var_71_arg_1=1, var_7=0, var_89=0, var_93=2, var_97=1] [L292] EXPR var_71_arg_0 & var_71_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L292] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L293] SORT_1 var_74_arg_0 = var_71; [L294] SORT_1 var_74 = ~var_74_arg_0; [L295] SORT_1 var_75_arg_0 = var_12; [L296] SORT_1 var_75_arg_1 = var_74; VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_75_arg_0=1, var_75_arg_1=-1, var_7=0, var_89=0, var_93=2, var_97=1] [L297] EXPR var_75_arg_0 & var_75_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L297] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L298] EXPR var_75 & mask_SORT_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L298] var_75 = var_75 & mask_SORT_1 [L299] SORT_1 bad_76_arg_0 = var_75; [L300] CALL __VERIFIER_assert(!(bad_76_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 585 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 822 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 822 mSDsluCounter, 8657 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5762 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1804 IncrementalHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 2895 mSDtfsCounter, 1804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=592occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-08 00:15:02,332 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.vis_arrays_vsaR_p01.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 879e24419bd498e1e21caa9587c0e4309307886fe7a917d7b60b20729c232f2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:15:04,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:15:04,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:15:04,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:15:04,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:15:04,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:15:04,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:15:04,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:15:04,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:15:04,237 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:15:04,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:15:04,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:15:04,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:15:04,238 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:15:04,239 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:04,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:15:04,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:15:04,239 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 -> 879e24419bd498e1e21caa9587c0e4309307886fe7a917d7b60b20729c232f2d [2025-02-08 00:15:04,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:15:04,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:15:04,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:15:04,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:15:04,450 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:15:04,451 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.vis_arrays_vsaR_p01.c [2025-02-08 00:15:05,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edac24c93/a82e8758ee8e4617b90994919f6bf151/FLAG9d02bec9d [2025-02-08 00:15:05,856 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:15:05,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.c [2025-02-08 00:15:05,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edac24c93/a82e8758ee8e4617b90994919f6bf151/FLAG9d02bec9d [2025-02-08 00:15:06,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edac24c93/a82e8758ee8e4617b90994919f6bf151 [2025-02-08 00:15:06,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:15:06,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:15:06,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:06,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:15:06,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:15:06,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b999da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06, skipping insertion in model container [2025-02-08 00:15:06,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:15:06,328 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.vis_arrays_vsaR_p01.c[1259,1272] [2025-02-08 00:15:06,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:06,502 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:15:06,508 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.vis_arrays_vsaR_p01.c[1259,1272] [2025-02-08 00:15:06,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:06,606 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:15:06,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06 WrapperNode [2025-02-08 00:15:06,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:06,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:06,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:15:06,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:15:06,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,727 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1206 [2025-02-08 00:15:06,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:06,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:15:06,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:15:06,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:15:06,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,771 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-08 00:15:06,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:06,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:06,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:06,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:06,825 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (1/1) ... [2025-02-08 00:15:06,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:06,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:06,852 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-08 00:15:06,854 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-08 00:15:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:15:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:07,062 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:07,064 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:08,105 INFO L? ?]: Removed 185 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:08,105 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:08,111 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:08,112 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:08,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:08 BoogieIcfgContainer [2025-02-08 00:15:08,112 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:08,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:08,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:08,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:08,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:15:06" (1/3) ... [2025-02-08 00:15:08,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2217a46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:08, skipping insertion in model container [2025-02-08 00:15:08,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:06" (2/3) ... [2025-02-08 00:15:08,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2217a46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:08, skipping insertion in model container [2025-02-08 00:15:08,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:08" (3/3) ... [2025-02-08 00:15:08,119 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p01.c [2025-02-08 00:15:08,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:08,132 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p01.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:08,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:08,168 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;@41cec12c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:08,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:08,171 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-08 00:15:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:15:08,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:08,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:15:08,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:08,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:08,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:15:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:15:08,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1534552850] [2025-02-08 00:15:08,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:08,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:08,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:08,186 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-08 00:15:08,187 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-08 00:15:08,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:15:08,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:15:08,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:08,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:08,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:15:08,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:15:08,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:15:08,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:08,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:08,695 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 00:15:08,698 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:15:08,699 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:15:08,709 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-08 00:15:08,901 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-08 00:15:08,906 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 00:15:08,923 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:15:08,931 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:15:08,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:15:08 BoogieIcfgContainer [2025-02-08 00:15:08,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:15:08,935 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:15:08,935 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:15:08,935 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:15:08,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:08" (3/4) ... [2025-02-08 00:15:08,936 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 00:15:08,943 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:15:08,993 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 3. [2025-02-08 00:15:09,024 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 00:15:09,024 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 00:15:09,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:15:09,026 INFO L158 Benchmark]: Toolchain (without parser) took 2842.74ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 89.5MB in the beginning and 141.2MB in the end (delta: -51.7MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2025-02-08 00:15:09,026 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:15:09,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.10ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 49.2MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 00:15:09,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.56ms. Allocated memory is still 117.4MB. Free memory was 49.2MB in the beginning and 82.4MB in the end (delta: -33.2MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2025-02-08 00:15:09,028 INFO L158 Benchmark]: Boogie Preprocessor took 92.35ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 72.1MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:15:09,029 INFO L158 Benchmark]: IcfgBuilder took 1287.81ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 72.1MB in the beginning and 81.3MB in the end (delta: -9.2MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. [2025-02-08 00:15:09,029 INFO L158 Benchmark]: TraceAbstraction took 820.01ms. Allocated memory is still 234.9MB. Free memory was 81.3MB in the beginning and 152.0MB in the end (delta: -70.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:15:09,030 INFO L158 Benchmark]: Witness Printer took 90.05ms. Allocated memory is still 234.9MB. Free memory was 152.0MB in the beginning and 141.2MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:15:09,031 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.42ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.10ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 49.2MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.56ms. Allocated memory is still 117.4MB. Free memory was 49.2MB in the beginning and 82.4MB in the end (delta: -33.2MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.35ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 72.1MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1287.81ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 72.1MB in the beginning and 81.3MB in the end (delta: -9.2MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. * TraceAbstraction took 820.01ms. Allocated memory is still 234.9MB. Free memory was 81.3MB in the beginning and 152.0MB in the end (delta: -70.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 90.05ms. Allocated memory is still 234.9MB. Free memory was 152.0MB in the beginning and 141.2MB in the end (delta: 10.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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 32); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (32 - 1); [L38] const SORT_88 mask_SORT_88 = (SORT_88)-1 >> (sizeof(SORT_88) * 8 - 3); [L39] const SORT_88 msb_SORT_88 = (SORT_88)1 << (3 - 1); [L41] const SORT_115 mask_SORT_115 = (SORT_115)-1 >> (sizeof(SORT_115) * 8 - 2); [L42] const SORT_115 msb_SORT_115 = (SORT_115)1 << (2 - 1); [L44] const SORT_222 mask_SORT_222 = (SORT_222)-1 >> (sizeof(SORT_222) * 8 - 4); [L45] const SORT_222 msb_SORT_222 = (SORT_222)1 << (4 - 1); [L47] const SORT_3 var_7 = 0; [L48] const SORT_1 var_12 = 1; [L49] const SORT_1 var_19 = 0; [L50] const SORT_21 var_23 = 12; [L51] const SORT_21 var_29 = 15; [L52] const SORT_21 var_36 = 8; [L53] const SORT_21 var_42 = 11; [L54] const SORT_21 var_50 = 4; [L55] const SORT_21 var_56 = 7; [L56] const SORT_5 var_83 = 0; [L57] const SORT_88 var_89 = 0; [L58] const SORT_88 var_93 = 2; [L59] const SORT_88 var_97 = 1; [L60] const SORT_88 var_102 = 4; [L61] const SORT_88 var_104 = 5; [L62] const SORT_88 var_108 = 3; [L63] const SORT_21 var_118 = 0; [L64] const SORT_3 var_125 = 31; [L65] const SORT_88 var_313 = 7; [L66] const SORT_88 var_318 = 6; [L67] const SORT_3 var_378 = 2; [L69] SORT_1 input_2; [L70] SORT_3 input_4; [L71] SORT_5 input_6; [L72] SORT_3 input_112; [L73] SORT_3 input_113; [L74] SORT_3 input_114; [L75] SORT_3 input_124; [L76] SORT_3 input_134; [L77] SORT_3 input_135; [L78] SORT_3 input_136; [L79] SORT_3 input_139; [L80] SORT_3 input_158; [L81] SORT_3 input_159; [L82] SORT_3 input_160; [L83] SORT_3 input_163; [L84] SORT_3 input_165; [L85] SORT_115 input_179; [L86] SORT_115 input_180; [L87] SORT_115 input_181; [L89] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] SORT_3 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] SORT_3 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] SORT_3 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_3 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] SORT_3 state_77 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_3 state_79 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L98] SORT_1 state_81 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] SORT_5 state_84 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L100] SORT_3 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L101] SORT_88 state_90 = __VERIFIER_nondet_uchar() & mask_SORT_88; [L103] SORT_3 init_9_arg_1 = var_7; [L104] state_8 = init_9_arg_1 [L105] SORT_3 init_11_arg_1 = var_7; [L106] state_10 = init_11_arg_1 [L107] SORT_3 init_15_arg_1 = var_7; [L108] state_14 = init_15_arg_1 [L109] SORT_3 init_17_arg_1 = var_7; [L110] state_16 = init_17_arg_1 [L111] SORT_3 init_61_arg_1 = var_7; [L112] state_60 = init_61_arg_1 [L113] SORT_3 init_65_arg_1 = var_7; [L114] state_64 = init_65_arg_1 [L115] SORT_3 init_69_arg_1 = var_7; [L116] state_68 = init_69_arg_1 [L117] SORT_3 init_78_arg_1 = var_7; [L118] state_77 = init_78_arg_1 [L119] SORT_3 init_80_arg_1 = var_7; [L120] state_79 = init_80_arg_1 [L121] SORT_1 init_82_arg_1 = var_19; [L122] state_81 = init_82_arg_1 [L123] SORT_5 init_85_arg_1 = var_83; [L124] state_84 = init_85_arg_1 [L125] SORT_3 init_87_arg_1 = var_7; [L126] state_86 = init_87_arg_1 [L127] SORT_88 init_91_arg_1 = var_89; [L128] state_90 = init_91_arg_1 VAL [mask_SORT_115=3, mask_SORT_1=1, mask_SORT_222=15, mask_SORT_3=31, mask_SORT_88=7, state_10=0, state_14=0, state_16=0, state_60=0, state_64=0, state_68=0, state_77=0, state_79=0, state_81=0, state_84=0, state_86=0, state_8=0, state_90=0, var_102=4, var_104=5, var_108=3, var_118=0, var_125=31, var_12=1, var_19=0, var_23=12, var_29=15, var_313=7, var_318=6, var_36=8, var_378=2, var_42=11, var_50=4, var_56=7, var_7=0, var_89=0, var_93=2, var_97=1] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] input_6 = __VERIFIER_nondet_ushort() [L134] input_112 = __VERIFIER_nondet_uchar() [L135] input_113 = __VERIFIER_nondet_uchar() [L136] input_114 = __VERIFIER_nondet_uchar() [L137] input_124 = __VERIFIER_nondet_uchar() [L138] input_134 = __VERIFIER_nondet_uchar() [L139] input_135 = __VERIFIER_nondet_uchar() [L140] input_136 = __VERIFIER_nondet_uchar() [L141] input_139 = __VERIFIER_nondet_uchar() [L142] input_158 = __VERIFIER_nondet_uchar() [L143] input_159 = __VERIFIER_nondet_uchar() [L144] input_160 = __VERIFIER_nondet_uchar() [L145] input_163 = __VERIFIER_nondet_uchar() [L146] input_165 = __VERIFIER_nondet_uchar() [L147] input_179 = __VERIFIER_nondet_uchar() [L148] input_180 = __VERIFIER_nondet_uchar() [L149] input_181 = __VERIFIER_nondet_uchar() [L152] SORT_1 var_18_arg_0 = var_12; [L153] SORT_3 var_18_arg_1 = state_16; [L154] SORT_3 var_18_arg_2 = state_14; [L155] SORT_3 var_18 = var_18_arg_0 ? var_18_arg_1 : var_18_arg_2; [L156] SORT_1 var_13_arg_0 = var_12; [L157] SORT_3 var_13_arg_1 = state_10; [L158] SORT_3 var_13_arg_2 = state_8; [L159] SORT_3 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L160] SORT_1 var_20_arg_0 = var_19; [L161] SORT_3 var_20_arg_1 = var_18; [L162] SORT_3 var_20_arg_2 = var_13; [L163] SORT_3 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L164] SORT_3 var_22_arg_0 = var_20; [L165] var_22_arg_0 = var_22_arg_0 & mask_SORT_3 [L166] SORT_21 var_22 = var_22_arg_0; [L167] SORT_21 var_24_arg_0 = var_22; [L168] SORT_21 var_24_arg_1 = var_23; [L169] SORT_1 var_24 = var_24_arg_0 >= var_24_arg_1; [L170] SORT_1 var_26_arg_0 = var_12; [L171] SORT_3 var_26_arg_1 = state_16; [L172] SORT_3 var_26_arg_2 = state_14; [L173] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L174] SORT_1 var_25_arg_0 = var_12; [L175] SORT_3 var_25_arg_1 = state_10; [L176] SORT_3 var_25_arg_2 = state_8; [L177] SORT_3 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L178] SORT_1 var_27_arg_0 = var_19; [L179] SORT_3 var_27_arg_1 = var_26; [L180] SORT_3 var_27_arg_2 = var_25; [L181] SORT_3 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L182] SORT_3 var_28_arg_0 = var_27; [L183] var_28_arg_0 = var_28_arg_0 & mask_SORT_3 [L184] SORT_21 var_28 = var_28_arg_0; [L185] SORT_21 var_30_arg_0 = var_28; [L186] SORT_21 var_30_arg_1 = var_29; [L187] SORT_1 var_30 = var_30_arg_0 <= var_30_arg_1; [L188] SORT_1 var_31_arg_0 = var_24; [L189] SORT_1 var_31_arg_1 = var_30; [L190] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L191] SORT_1 var_33_arg_0 = var_19; [L192] SORT_3 var_33_arg_1 = state_16; [L193] SORT_3 var_33_arg_2 = state_14; [L194] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L195] SORT_1 var_32_arg_0 = var_19; [L196] SORT_3 var_32_arg_1 = state_10; [L197] SORT_3 var_32_arg_2 = state_8; [L198] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L199] SORT_1 var_34_arg_0 = var_12; [L200] SORT_3 var_34_arg_1 = var_33; [L201] SORT_3 var_34_arg_2 = var_32; [L202] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L203] SORT_3 var_35_arg_0 = var_34; [L204] var_35_arg_0 = var_35_arg_0 & mask_SORT_3 [L205] SORT_21 var_35 = var_35_arg_0; [L206] SORT_21 var_37_arg_0 = var_35; [L207] SORT_21 var_37_arg_1 = var_36; [L208] SORT_1 var_37 = var_37_arg_0 >= var_37_arg_1; [L209] SORT_1 var_39_arg_0 = var_19; [L210] SORT_3 var_39_arg_1 = state_16; [L211] SORT_3 var_39_arg_2 = state_14; [L212] SORT_3 var_39 = var_39_arg_0 ? var_39_arg_1 : var_39_arg_2; [L213] SORT_1 var_38_arg_0 = var_19; [L214] SORT_3 var_38_arg_1 = state_10; [L215] SORT_3 var_38_arg_2 = state_8; [L216] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L217] SORT_1 var_40_arg_0 = var_12; [L218] SORT_3 var_40_arg_1 = var_39; [L219] SORT_3 var_40_arg_2 = var_38; [L220] SORT_3 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; [L221] SORT_3 var_41_arg_0 = var_40; [L222] var_41_arg_0 = var_41_arg_0 & mask_SORT_3 [L223] SORT_21 var_41 = var_41_arg_0; [L224] SORT_21 var_43_arg_0 = var_41; [L225] SORT_21 var_43_arg_1 = var_42; [L226] SORT_1 var_43 = var_43_arg_0 <= var_43_arg_1; [L227] SORT_1 var_44_arg_0 = var_37; [L228] SORT_1 var_44_arg_1 = var_43; [L229] SORT_1 var_44 = var_44_arg_0 & var_44_arg_1; [L230] SORT_1 var_45_arg_0 = var_31; [L231] SORT_1 var_45_arg_1 = var_44; [L232] SORT_1 var_45 = var_45_arg_0 & var_45_arg_1; [L233] SORT_1 var_47_arg_0 = var_12; [L234] SORT_3 var_47_arg_1 = state_16; [L235] SORT_3 var_47_arg_2 = state_14; [L236] SORT_3 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L237] SORT_1 var_46_arg_0 = var_12; [L238] SORT_3 var_46_arg_1 = state_10; [L239] SORT_3 var_46_arg_2 = state_8; [L240] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L241] SORT_1 var_48_arg_0 = var_12; [L242] SORT_3 var_48_arg_1 = var_47; [L243] SORT_3 var_48_arg_2 = var_46; [L244] SORT_3 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L245] SORT_3 var_49_arg_0 = var_48; [L246] var_49_arg_0 = var_49_arg_0 & mask_SORT_3 [L247] SORT_21 var_49 = var_49_arg_0; [L248] SORT_21 var_51_arg_0 = var_49; [L249] SORT_21 var_51_arg_1 = var_50; [L250] SORT_1 var_51 = var_51_arg_0 >= var_51_arg_1; [L251] SORT_1 var_53_arg_0 = var_12; [L252] SORT_3 var_53_arg_1 = state_16; [L253] SORT_3 var_53_arg_2 = state_14; [L254] SORT_3 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L255] SORT_1 var_52_arg_0 = var_12; [L256] SORT_3 var_52_arg_1 = state_10; [L257] SORT_3 var_52_arg_2 = state_8; [L258] SORT_3 var_52 = var_52_arg_0 ? var_52_arg_1 : var_52_arg_2; [L259] SORT_1 var_54_arg_0 = var_12; [L260] SORT_3 var_54_arg_1 = var_53; [L261] SORT_3 var_54_arg_2 = var_52; [L262] SORT_3 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L263] SORT_3 var_55_arg_0 = var_54; [L264] var_55_arg_0 = var_55_arg_0 & mask_SORT_3 [L265] SORT_21 var_55 = var_55_arg_0; [L266] SORT_21 var_57_arg_0 = var_55; [L267] SORT_21 var_57_arg_1 = var_56; [L268] SORT_1 var_57 = var_57_arg_0 <= var_57_arg_1; [L269] SORT_1 var_58_arg_0 = var_51; [L270] SORT_1 var_58_arg_1 = var_57; [L271] SORT_1 var_58 = var_58_arg_0 & var_58_arg_1; [L272] SORT_1 var_59_arg_0 = var_45; [L273] SORT_1 var_59_arg_1 = var_58; [L274] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L275] SORT_3 var_62_arg_0 = state_60; [L276] SORT_3 var_62_arg_1 = var_7; [L277] SORT_1 var_62 = var_62_arg_0 == var_62_arg_1; [L278] SORT_1 var_63_arg_0 = var_59; [L279] SORT_1 var_63_arg_1 = var_62; [L280] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L281] SORT_3 var_66_arg_0 = state_64; [L282] SORT_3 var_66_arg_1 = var_7; [L283] SORT_1 var_66 = var_66_arg_0 == var_66_arg_1; [L284] SORT_1 var_67_arg_0 = var_63; [L285] SORT_1 var_67_arg_1 = var_66; [L286] SORT_1 var_67 = var_67_arg_0 & var_67_arg_1; [L287] SORT_3 var_70_arg_0 = state_68; [L288] SORT_3 var_70_arg_1 = var_7; [L289] SORT_1 var_70 = var_70_arg_0 == var_70_arg_1; [L290] SORT_1 var_71_arg_0 = var_67; [L291] SORT_1 var_71_arg_1 = var_70; [L292] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L293] SORT_1 var_74_arg_0 = var_71; [L294] SORT_1 var_74 = ~var_74_arg_0; [L295] SORT_1 var_75_arg_0 = var_12; [L296] SORT_1 var_75_arg_1 = var_74; [L297] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L298] var_75 = var_75 & mask_SORT_1 [L299] SORT_1 bad_76_arg_0 = var_75; [L300] CALL __VERIFIER_assert(!(bad_76_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: 0.8s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 proved your program to be incorrect! [2025-02-08 00:15:09,046 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