./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-08 09:43:28,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:43:28,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:43:28,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:43:28,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:43:28,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:43:28,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:43:28,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:43:28,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:43:28,364 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:43:28,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:43:28,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:43:28,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:43:28,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:43:28,365 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:43:28,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:43:28,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:43:28,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:43:28,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:43:28,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:43:28,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:43:28,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:43:28,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:43:28,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:43:28,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:43:28,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:43:28,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:43:28,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:43:28,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:43:28,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:43:28,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:43:28,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:43:28,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:43:28,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:43:28,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:43:28,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:43:28,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:43:28,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:43:28,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:43:28,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:43:28,368 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/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-03-08 09:43:28,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:43:28,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:43:28,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:43:28,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:43:28,598 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:43:28,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.c [2025-03-08 09:43:29,790 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000d26088/9a12d7a3f64f42dcaa7897abbcd2583f/FLAG0c63211d3 [2025-03-08 09:43:30,072 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:43:30,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.c [2025-03-08 09:43:30,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000d26088/9a12d7a3f64f42dcaa7897abbcd2583f/FLAG0c63211d3 [2025-03-08 09:43:30,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000d26088/9a12d7a3f64f42dcaa7897abbcd2583f [2025-03-08 09:43:30,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:43:30,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:43:30,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:43:30,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:43:30,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:43:30,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:30,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53529c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30, skipping insertion in model container [2025-03-08 09:43:30,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:30,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:43:30,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.c[1259,1272] [2025-03-08 09:43:30,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:43:30,471 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:43:30,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.c[1259,1272] [2025-03-08 09:43:30,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:43:30,592 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:43:30,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30 WrapperNode [2025-03-08 09:43:30,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:43:30,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:43:30,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:43:30,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:43:30,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:30,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:30,787 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2360 [2025-03-08 09:43:30,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:43:30,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:43:30,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:43:30,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:43:30,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:30,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:30,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:30,953 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-03-08 09:43:30,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:30,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:31,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:31,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:31,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:31,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:31,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:43:31,062 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:43:31,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:43:31,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:43:31,064 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (1/1) ... [2025-03-08 09:43:31,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:43:31,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:43:31,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:43:31,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:43:31,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:43:31,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:43:31,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:43:31,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:43:31,311 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:43:31,312 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:43:33,245 INFO L? ?]: Removed 1495 outVars from TransFormulas that were not future-live. [2025-03-08 09:43:33,245 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:43:33,342 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:43:33,343 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:43:33,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:43:33 BoogieIcfgContainer [2025-03-08 09:43:33,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:43:33,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:43:33,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:43:33,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:43:33,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:43:30" (1/3) ... [2025-03-08 09:43:33,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628d48c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:43:33, skipping insertion in model container [2025-03-08 09:43:33,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:30" (2/3) ... [2025-03-08 09:43:33,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628d48c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:43:33, skipping insertion in model container [2025-03-08 09:43:33,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:43:33" (3/3) ... [2025-03-08 09:43:33,352 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p01.c [2025-03-08 09:43:33,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:43:33,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p01.c that has 1 procedures, 587 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:43:33,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:43:33,434 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;@12eba3fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:43:33,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:43:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 587 states, 585 states have (on average 1.4991452991452991) internal successors, (877), 586 states have internal predecessors, (877), 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-03-08 09:43:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 09:43:33,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:33,447 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-03-08 09:43:33,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:33,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -482970885, now seen corresponding path program 1 times [2025-03-08 09:43:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887768320] [2025-03-08 09:43:33,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:33,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 09:43:33,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 09:43:33,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:33,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:34,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:34,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887768320] [2025-03-08 09:43:34,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887768320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:34,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:34,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:43:34,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141448832] [2025-03-08 09:43:34,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:34,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:43:34,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:34,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:43:34,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:43:34,264 INFO L87 Difference]: Start difference. First operand has 587 states, 585 states have (on average 1.4991452991452991) internal successors, (877), 586 states have internal predecessors, (877), 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.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-03-08 09:43:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:34,576 INFO L93 Difference]: Finished difference Result 1119 states and 1675 transitions. [2025-03-08 09:43:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:43:34,578 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-03-08 09:43:34,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:34,589 INFO L225 Difference]: With dead ends: 1119 [2025-03-08 09:43:34,589 INFO L226 Difference]: Without dead ends: 586 [2025-03-08 09:43:34,594 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-03-08 09:43:34,597 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 0 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2176 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-03-08 09:43:34,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2176 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:43:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-08 09:43:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-03-08 09:43:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.4957264957264957) internal successors, (875), 585 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-03-08 09:43:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 875 transitions. [2025-03-08 09:43:34,655 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 875 transitions. Word has length 63 [2025-03-08 09:43:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:34,656 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 875 transitions. [2025-03-08 09:43:34,656 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-03-08 09:43:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 875 transitions. [2025-03-08 09:43:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 09:43:34,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:34,657 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-03-08 09:43:34,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:43:34,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:34,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:34,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2082515595, now seen corresponding path program 1 times [2025-03-08 09:43:34,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:34,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897804044] [2025-03-08 09:43:34,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:34,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:34,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 09:43:34,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 09:43:34,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:34,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:34,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:34,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897804044] [2025-03-08 09:43:34,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897804044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:34,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:34,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:43:34,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742299183] [2025-03-08 09:43:34,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:34,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:43:34,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:34,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:43:34,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:43:34,925 INFO L87 Difference]: Start difference. First operand 586 states and 875 transitions. Second operand has 4 states, 4 states have (on average 16.0) 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-03-08 09:43:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:35,209 INFO L93 Difference]: Finished difference Result 1120 states and 1673 transitions. [2025-03-08 09:43:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:43:35,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) 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-03-08 09:43:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:35,212 INFO L225 Difference]: With dead ends: 1120 [2025-03-08 09:43:35,212 INFO L226 Difference]: Without dead ends: 588 [2025-03-08 09:43:35,213 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-03-08 09:43:35,213 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 0 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2173 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:43:35,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2173 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:43:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-08 09:43:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2025-03-08 09:43:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 1.494037478705281) internal successors, (877), 587 states have internal predecessors, (877), 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-03-08 09:43:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 877 transitions. [2025-03-08 09:43:35,225 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 877 transitions. Word has length 64 [2025-03-08 09:43:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:35,226 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 877 transitions. [2025-03-08 09:43:35,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) 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-03-08 09:43:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 877 transitions. [2025-03-08 09:43:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 09:43:35,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:35,227 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-03-08 09:43:35,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:43:35,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:35,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1798036022, now seen corresponding path program 1 times [2025-03-08 09:43:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:35,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641612666] [2025-03-08 09:43:35,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:35,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 09:43:35,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 09:43:35,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:35,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:35,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:35,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641612666] [2025-03-08 09:43:35,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641612666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:35,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:35,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:43:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378113591] [2025-03-08 09:43:35,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:35,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:43:35,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:35,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:43:35,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:43:35,681 INFO L87 Difference]: Start difference. First operand 588 states and 877 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-03-08 09:43:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:36,021 INFO L93 Difference]: Finished difference Result 1126 states and 1680 transitions. [2025-03-08 09:43:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:43:36,022 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-03-08 09:43:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:36,024 INFO L225 Difference]: With dead ends: 1126 [2025-03-08 09:43:36,024 INFO L226 Difference]: Without dead ends: 592 [2025-03-08 09:43:36,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03-08 09:43:36,025 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 822 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2147 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-03-08 09:43:36,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2147 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:43:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-08 09:43:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 591. [2025-03-08 09:43:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.4915254237288136) internal successors, (880), 590 states have internal predecessors, (880), 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-03-08 09:43:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 880 transitions. [2025-03-08 09:43:36,044 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 880 transitions. Word has length 65 [2025-03-08 09:43:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:36,045 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 880 transitions. [2025-03-08 09:43:36,045 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-03-08 09:43:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 880 transitions. [2025-03-08 09:43:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 09:43:36,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:36,048 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, 1] [2025-03-08 09:43:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:43:36,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:36,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1792905146, now seen corresponding path program 1 times [2025-03-08 09:43:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:36,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039308095] [2025-03-08 09:43:36,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:36,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:36,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 09:43:36,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 09:43:36,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:36,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:36,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:36,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039308095] [2025-03-08 09:43:36,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039308095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:36,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:36,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:43:36,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019421077] [2025-03-08 09:43:36,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:36,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:43:36,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:36,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:43:36,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:43:36,291 INFO L87 Difference]: Start difference. First operand 591 states and 880 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 09:43:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:36,528 INFO L93 Difference]: Finished difference Result 1130 states and 1683 transitions. [2025-03-08 09:43:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:43:36,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2025-03-08 09:43:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:36,530 INFO L225 Difference]: With dead ends: 1130 [2025-03-08 09:43:36,530 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 09:43:36,531 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-03-08 09:43:36,531 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 0 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2173 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-03-08 09:43:36,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2173 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:43:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 09:43:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-03-08 09:43:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 1.489864864864865) internal successors, (882), 592 states have internal predecessors, (882), 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-03-08 09:43:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 882 transitions. [2025-03-08 09:43:36,541 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 882 transitions. Word has length 66 [2025-03-08 09:43:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:36,541 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 882 transitions. [2025-03-08 09:43:36,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 09:43:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 882 transitions. [2025-03-08 09:43:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 09:43:36,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:36,543 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, 1] [2025-03-08 09:43:36,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:43:36,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:36,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash 801326046, now seen corresponding path program 1 times [2025-03-08 09:43:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:36,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117298568] [2025-03-08 09:43:36,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:36,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 09:43:36,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 09:43:36,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:36,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:43:36,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:43:36,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 09:43:36,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 09:43:36,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:36,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:43:36,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:43:36,937 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:43:36,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:43:36,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:43:36,942 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 09:43:37,000 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:43:37,024 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:43:37,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:43:37 BoogieIcfgContainer [2025-03-08 09:43:37,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:43:37,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:43:37,028 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:43:37,029 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:43:37,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:43:33" (3/4) ... [2025-03-08 09:43:37,031 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:43:37,031 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:43:37,034 INFO L158 Benchmark]: Toolchain (without parser) took 6916.19ms. Allocated memory was 201.3MB in the beginning and 486.5MB in the end (delta: 285.2MB). Free memory was 151.8MB in the beginning and 373.5MB in the end (delta: -221.8MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2025-03-08 09:43:37,034 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:43:37,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.91ms. Allocated memory is still 201.3MB. Free memory was 151.8MB in the beginning and 104.2MB in the end (delta: 47.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 09:43:37,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 194.14ms. Allocated memory is still 201.3MB. Free memory was 104.2MB in the beginning and 52.2MB in the end (delta: 52.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 09:43:37,034 INFO L158 Benchmark]: Boogie Preprocessor took 272.36ms. Allocated memory is still 201.3MB. Free memory was 52.2MB in the beginning and 110.7MB in the end (delta: -58.6MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2025-03-08 09:43:37,035 INFO L158 Benchmark]: IcfgBuilder took 2280.85ms. Allocated memory was 201.3MB in the beginning and 402.7MB in the end (delta: 201.3MB). Free memory was 110.7MB in the beginning and 155.5MB in the end (delta: -44.7MB). Peak memory consumption was 165.0MB. Max. memory is 16.1GB. [2025-03-08 09:43:37,035 INFO L158 Benchmark]: TraceAbstraction took 3682.52ms. Allocated memory was 402.7MB in the beginning and 486.5MB in the end (delta: 83.9MB). Free memory was 155.5MB in the beginning and 373.6MB in the end (delta: -218.1MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2025-03-08 09:43:37,035 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 486.5MB. Free memory was 373.6MB in the beginning and 373.5MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:43:37,036 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.91ms. Allocated memory is still 201.3MB. Free memory was 151.8MB in the beginning and 104.2MB in the end (delta: 47.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 194.14ms. Allocated memory is still 201.3MB. Free memory was 104.2MB in the beginning and 52.2MB in the end (delta: 52.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 272.36ms. Allocated memory is still 201.3MB. Free memory was 52.2MB in the beginning and 110.7MB in the end (delta: -58.6MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2280.85ms. Allocated memory was 201.3MB in the beginning and 402.7MB in the end (delta: 201.3MB). Free memory was 110.7MB in the beginning and 155.5MB in the end (delta: -44.7MB). Peak memory consumption was 165.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3682.52ms. Allocated memory was 402.7MB in the beginning and 486.5MB in the end (delta: 83.9MB). Free memory was 155.5MB in the beginning and 373.6MB in the end (delta: -218.1MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 486.5MB. Free memory was 373.6MB in the beginning and 373.5MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 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, 587 locations, 877 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 822 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 822 mSDsluCounter, 8669 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5770 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1804 IncrementalHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 2899 mSDtfsCounter, 1804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=593occurred 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.2s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 405 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-03-08 09:43:37,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-08 09:43:38,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:43:39,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:43:39,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:43:39,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:43:39,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:43:39,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:43:39,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:43:39,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:43:39,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:43:39,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:43:39,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:43:39,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:43:39,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:43:39,034 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:43:39,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:43:39,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:43:39,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:43:39,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:43:39,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:43:39,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:43:39,037 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:43:39,037 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:43:39,037 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:43:39,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:43:39,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:43:39,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:43:39,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:43:39,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:43:39,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:43:39,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:43:39,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:43:39,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:43:39,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:43:39,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:43:39,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:43:39,039 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:43:39,039 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:43:39,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:43:39,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:43:39,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:43:39,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:43:39,039 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/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-03-08 09:43:39,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:43:39,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:43:39,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:43:39,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:43:39,336 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:43:39,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.c [2025-03-08 09:43:40,456 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0740069e/767442a67d4a465e80660fed081ddb01/FLAG4e6ebb03a [2025-03-08 09:43:40,717 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:43:40,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.c [2025-03-08 09:43:40,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0740069e/767442a67d4a465e80660fed081ddb01/FLAG4e6ebb03a [2025-03-08 09:43:40,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0740069e/767442a67d4a465e80660fed081ddb01 [2025-03-08 09:43:40,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:43:40,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:43:40,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:43:40,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:43:40,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:43:40,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:43:40" (1/1) ... [2025-03-08 09:43:40,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660b8faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:40, skipping insertion in model container [2025-03-08 09:43:40,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:43:40" (1/1) ... [2025-03-08 09:43:40,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:43:40,917 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.c[1259,1272] [2025-03-08 09:43:41,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:43:41,130 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:43:41,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p01.c[1259,1272] [2025-03-08 09:43:41,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:43:41,253 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:43:41,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41 WrapperNode [2025-03-08 09:43:41,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:43:41,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:43:41,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:43:41,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:43:41,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,326 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1206 [2025-03-08 09:43:41,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:43:41,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:43:41,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:43:41,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:43:41,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,384 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-03-08 09:43:41,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,403 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:43:41,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:43:41,431 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:43:41,431 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:43:41,432 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (1/1) ... [2025-03-08 09:43:41,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:43:41,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:43:41,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:43:41,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:43:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:43:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:43:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:43:41,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:43:41,719 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:43:41,720 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:43:42,950 INFO L? ?]: Removed 187 outVars from TransFormulas that were not future-live. [2025-03-08 09:43:42,950 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:43:42,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:43:42,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:43:42,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:43:42 BoogieIcfgContainer [2025-03-08 09:43:42,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:43:42,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:43:42,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:43:42,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:43:42,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:43:40" (1/3) ... [2025-03-08 09:43:42,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb8382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:43:42, skipping insertion in model container [2025-03-08 09:43:42,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:41" (2/3) ... [2025-03-08 09:43:42,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb8382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:43:42, skipping insertion in model container [2025-03-08 09:43:42,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:43:42" (3/3) ... [2025-03-08 09:43:42,969 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p01.c [2025-03-08 09:43:42,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:43:42,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p01.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:43:43,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:43:43,039 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;@29728090, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:43:43,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:43:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-03-08 09:43:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:43:43,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:43,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:43:43,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:43,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:43:43,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:43:43,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969746280] [2025-03-08 09:43:43,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:43,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:43:43,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:43:43,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:43:43,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:43:43,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:43:43,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:43:43,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:43,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:43:43,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:43:43,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:43:43,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:43:43,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:43,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:43:43,591 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-08 09:43:43,592 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:43:43,593 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:43:43,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 09:43:43,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:43:43,798 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-08 09:43:43,815 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:43:43,826 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:43:43,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:43:43 BoogieIcfgContainer [2025-03-08 09:43:43,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:43:43,828 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:43:43,828 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:43:43,828 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:43:43,829 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:43:42" (3/4) ... [2025-03-08 09:43:43,829 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 09:43:43,834 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:43:43,877 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 3. [2025-03-08 09:43:43,908 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 09:43:43,909 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 09:43:43,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:43:43,909 INFO L158 Benchmark]: Toolchain (without parser) took 3164.49ms. Allocated memory was 83.9MB in the beginning and 209.7MB in the end (delta: 125.8MB). Free memory was 57.6MB in the beginning and 129.5MB in the end (delta: -71.9MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2025-03-08 09:43:43,909 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:43:43,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.51ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 51.4MB in the end (delta: 6.2MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2025-03-08 09:43:43,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.57ms. Allocated memory is still 83.9MB. Free memory was 51.4MB in the beginning and 42.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:43:43,910 INFO L158 Benchmark]: Boogie Preprocessor took 101.63ms. Allocated memory is still 83.9MB. Free memory was 42.3MB in the beginning and 32.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:43:43,910 INFO L158 Benchmark]: IcfgBuilder took 1529.53ms. Allocated memory was 83.9MB in the beginning and 209.7MB in the end (delta: 125.8MB). Free memory was 32.3MB in the beginning and 77.9MB in the end (delta: -45.6MB). Peak memory consumption was 115.8MB. Max. memory is 16.1GB. [2025-03-08 09:43:43,911 INFO L158 Benchmark]: TraceAbstraction took 865.78ms. Allocated memory is still 209.7MB. Free memory was 77.9MB in the beginning and 138.1MB in the end (delta: -60.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:43:43,911 INFO L158 Benchmark]: Witness Printer took 80.62ms. Allocated memory is still 209.7MB. Free memory was 138.1MB in the beginning and 129.5MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:43:43,912 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.37ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.51ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 51.4MB in the end (delta: 6.2MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.57ms. Allocated memory is still 83.9MB. Free memory was 51.4MB in the beginning and 42.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.63ms. Allocated memory is still 83.9MB. Free memory was 42.3MB in the beginning and 32.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1529.53ms. Allocated memory was 83.9MB in the beginning and 209.7MB in the end (delta: 125.8MB). Free memory was 32.3MB in the beginning and 77.9MB in the end (delta: -45.6MB). Peak memory consumption was 115.8MB. Max. memory is 16.1GB. * TraceAbstraction took 865.78ms. Allocated memory is still 209.7MB. Free memory was 77.9MB in the beginning and 138.1MB in the end (delta: -60.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 80.62ms. Allocated memory is still 209.7MB. Free memory was 138.1MB in the beginning and 129.5MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 10 locations, 11 edges, 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=10occurred 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, 5 NumberOfCodeBlocks, 5 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-03-08 09:43:43,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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