./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.vcegar_QF_BV_itc99_b13_p03.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 3b705ca0c5b5371dfb056caad606a25fce2d2b74615677865ff593635c093e46 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:44:25,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:44:25,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:44:25,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:44:25,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:44:25,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:44:25,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:44:25,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:44:25,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:44:25,268 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:44:25,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:44:25,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:44:25,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:44:25,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:44:25,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:44:25,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:44:25,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:44:25,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:44:25,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:44:25,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:44:25,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:44:25,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:44:25,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:44:25,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:44:25,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:44:25,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:44:25,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:44:25,271 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 -> 3b705ca0c5b5371dfb056caad606a25fce2d2b74615677865ff593635c093e46 [2025-03-16 22:44:25,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:44:25,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:44:25,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:44:25,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:44:25,509 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:44:25,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c [2025-03-16 22:44:26,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ed99dc1/8958570f07f443f49d2b5ba2f0f8ce74/FLAG1be360549 [2025-03-16 22:44:26,890 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:44:26,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c [2025-03-16 22:44:26,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ed99dc1/8958570f07f443f49d2b5ba2f0f8ce74/FLAG1be360549 [2025-03-16 22:44:26,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ed99dc1/8958570f07f443f49d2b5ba2f0f8ce74 [2025-03-16 22:44:26,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:44:26,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:44:26,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:44:26,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:44:26,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:44:26,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:44:26" (1/1) ... [2025-03-16 22:44:26,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:26, skipping insertion in model container [2025-03-16 22:44:26,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:44:26" (1/1) ... [2025-03-16 22:44:26,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:44:27,057 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.vcegar_QF_BV_itc99_b13_p03.c[1266,1279] [2025-03-16 22:44:27,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:44:27,165 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:44:27,174 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.vcegar_QF_BV_itc99_b13_p03.c[1266,1279] [2025-03-16 22:44:27,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:44:27,234 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:44:27,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27 WrapperNode [2025-03-16 22:44:27,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:44:27,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:44:27,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:44:27,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:44:27,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,301 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 682 [2025-03-16 22:44:27,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:44:27,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:44:27,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:44:27,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:44:27,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,351 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-16 22:44:27,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:44:27,406 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:44:27,406 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:44:27,406 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:44:27,407 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (1/1) ... [2025-03-16 22:44:27,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:44:27,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:44:27,432 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-16 22:44:27,437 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-16 22:44:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:44:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:44:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:44:27,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:44:27,567 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:44:27,569 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:44:28,170 INFO L? ?]: Removed 347 outVars from TransFormulas that were not future-live. [2025-03-16 22:44:28,170 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:44:28,204 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:44:28,205 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:44:28,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:44:28 BoogieIcfgContainer [2025-03-16 22:44:28,206 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:44:28,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:44:28,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:44:28,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:44:28,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:44:26" (1/3) ... [2025-03-16 22:44:28,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3202d00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:44:28, skipping insertion in model container [2025-03-16 22:44:28,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:27" (2/3) ... [2025-03-16 22:44:28,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3202d00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:44:28, skipping insertion in model container [2025-03-16 22:44:28,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:44:28" (3/3) ... [2025-03-16 22:44:28,213 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c [2025-03-16 22:44:28,224 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:44:28,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c that has 1 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:44:28,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:44:28,282 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;@2b7f5aa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:44:28,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:44:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.5) internal successors, (189), 127 states have internal predecessors, (189), 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-16 22:44:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 22:44:28,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:28,294 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] [2025-03-16 22:44:28,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:28,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2028305812, now seen corresponding path program 1 times [2025-03-16 22:44:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:28,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577969944] [2025-03-16 22:44:28,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:28,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:28,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 22:44:28,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 22:44:28,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:28,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:28,780 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-16 22:44:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:28,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577969944] [2025-03-16 22:44:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577969944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:28,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:28,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:28,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788559100] [2025-03-16 22:44:28,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:28,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:44:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:28,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:44:28,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:44:28,804 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.5) internal successors, (189), 127 states have internal predecessors, (189), 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 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-16 22:44:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:28,925 INFO L93 Difference]: Finished difference Result 207 states and 307 transitions. [2025-03-16 22:44:28,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:44:28,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2025-03-16 22:44:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:28,933 INFO L225 Difference]: With dead ends: 207 [2025-03-16 22:44:28,934 INFO L226 Difference]: Without dead ends: 128 [2025-03-16 22:44:28,936 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-16 22:44:28,939 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:28,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:44:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-16 22:44:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-16 22:44:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 127 states have internal predecessors, (188), 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-16 22:44:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 188 transitions. [2025-03-16 22:44:28,973 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 188 transitions. Word has length 34 [2025-03-16 22:44:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:28,973 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 188 transitions. [2025-03-16 22:44:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-16 22:44:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 188 transitions. [2025-03-16 22:44:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 22:44:28,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:28,974 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] [2025-03-16 22:44:28,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:44:28,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:28,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1542350020, now seen corresponding path program 1 times [2025-03-16 22:44:28,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:28,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710893685] [2025-03-16 22:44:28,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:29,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 22:44:29,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 22:44:29,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:29,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:29,134 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-16 22:44:29,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710893685] [2025-03-16 22:44:29,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710893685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:29,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:29,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:29,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933515641] [2025-03-16 22:44:29,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:29,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:44:29,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:29,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:44:29,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:44:29,136 INFO L87 Difference]: Start difference. First operand 128 states and 188 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-16 22:44:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:29,223 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2025-03-16 22:44:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:44:29,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2025-03-16 22:44:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:29,224 INFO L225 Difference]: With dead ends: 209 [2025-03-16 22:44:29,224 INFO L226 Difference]: Without dead ends: 130 [2025-03-16 22:44:29,225 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-16 22:44:29,225 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:29,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:44:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-16 22:44:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-16 22:44:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 129 states have internal predecessors, (190), 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-16 22:44:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 190 transitions. [2025-03-16 22:44:29,233 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 190 transitions. Word has length 35 [2025-03-16 22:44:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:29,233 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 190 transitions. [2025-03-16 22:44:29,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-16 22:44:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 190 transitions. [2025-03-16 22:44:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 22:44:29,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:29,234 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] [2025-03-16 22:44:29,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:44:29,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:29,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1363298959, now seen corresponding path program 1 times [2025-03-16 22:44:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:29,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168513719] [2025-03-16 22:44:29,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:29,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 22:44:29,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 22:44:29,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:29,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:29,455 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-16 22:44:29,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:29,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168513719] [2025-03-16 22:44:29,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168513719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:29,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:29,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:44:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368046916] [2025-03-16 22:44:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:29,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:44:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:29,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:44:29,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:44:29,458 INFO L87 Difference]: Start difference. First operand 130 states and 190 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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-16 22:44:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:29,557 INFO L93 Difference]: Finished difference Result 209 states and 305 transitions. [2025-03-16 22:44:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:44:29,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2025-03-16 22:44:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:29,559 INFO L225 Difference]: With dead ends: 209 [2025-03-16 22:44:29,559 INFO L226 Difference]: Without dead ends: 128 [2025-03-16 22:44:29,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:44:29,560 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 158 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:29,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 278 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:44:29,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-16 22:44:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-16 22:44:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4645669291338583) internal successors, (186), 127 states have internal predecessors, (186), 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-16 22:44:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2025-03-16 22:44:29,570 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 36 [2025-03-16 22:44:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:29,571 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2025-03-16 22:44:29,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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-16 22:44:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2025-03-16 22:44:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 22:44:29,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:29,571 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] [2025-03-16 22:44:29,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:44:29,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:29,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1639560392, now seen corresponding path program 1 times [2025-03-16 22:44:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:29,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765040051] [2025-03-16 22:44:29,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:29,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:29,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 22:44:29,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 22:44:29,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:29,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:44:29,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:44:29,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 22:44:29,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 22:44:29,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:29,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:44:29,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:44:29,652 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:44:29,653 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:44:29,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:44:29,657 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-16 22:44:29,674 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:44:29,683 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:44:29,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:44:29 BoogieIcfgContainer [2025-03-16 22:44:29,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:44:29,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:44:29,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:44:29,687 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:44:29,688 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:44:28" (3/4) ... [2025-03-16 22:44:29,689 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:44:29,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:44:29,692 INFO L158 Benchmark]: Toolchain (without parser) took 2770.97ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 52.2MB in the end (delta: 51.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2025-03-16 22:44:29,692 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:44:29,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.17ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 83.7MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:44:29,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.47ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 71.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:44:29,692 INFO L158 Benchmark]: Boogie Preprocessor took 102.96ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 63.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:44:29,693 INFO L158 Benchmark]: IcfgBuilder took 800.14ms. Allocated memory is still 142.6MB. Free memory was 63.8MB in the beginning and 53.0MB in the end (delta: 10.8MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2025-03-16 22:44:29,693 INFO L158 Benchmark]: TraceAbstraction took 1478.91ms. Allocated memory is still 142.6MB. Free memory was 52.3MB in the beginning and 52.3MB in the end (delta: 63.4kB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2025-03-16 22:44:29,693 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 142.6MB. Free memory was 52.3MB in the beginning and 52.2MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:44:29,694 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.17ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 83.7MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.47ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 71.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.96ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 63.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 800.14ms. Allocated memory is still 142.6MB. Free memory was 63.8MB in the beginning and 53.0MB in the end (delta: 10.8MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1478.91ms. Allocated memory is still 142.6MB. Free memory was 52.3MB in the beginning and 52.3MB in the end (delta: 63.4kB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 142.6MB. Free memory was 52.3MB in the beginning and 52.2MB in the end (delta: 24.0kB). 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 161. 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 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 10); [L33] const SORT_7 msb_SORT_7 = (SORT_7)1 << (10 - 1); [L35] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 2); [L36] const SORT_11 msb_SORT_11 = (SORT_11)1 << (2 - 1); [L38] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 32); [L39] const SORT_13 msb_SORT_13 = (SORT_13)1 << (32 - 1); [L41] const SORT_30 mask_SORT_30 = (SORT_30)-1 >> (sizeof(SORT_30) * 8 - 4); [L42] const SORT_30 msb_SORT_30 = (SORT_30)1 << (4 - 1); [L44] const SORT_7 var_8 = 0; [L45] const SORT_13 var_15 = 0; [L46] const SORT_1 var_19 = 1; [L47] const SORT_1 var_23 = 0; [L48] const SORT_13 var_74 = 1; [L49] const SORT_13 var_78 = 104; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_1 input_6; [L55] SORT_1 input_28; [L56] SORT_30 input_31; [L57] SORT_1 input_33; [L58] SORT_30 input_35; [L59] SORT_1 input_37; [L60] SORT_1 input_39; [L61] SORT_1 input_45; [L62] SORT_1 input_47; [L63] SORT_1 input_49; [L64] SORT_3 input_53; [L65] SORT_1 input_56; [L66] SORT_1 input_66; [L67] SORT_7 input_72; [L68] SORT_1 input_86; [L69] SORT_1 input_92; [L70] SORT_1 input_98; [L71] SORT_1 input_104; [L72] SORT_1 input_105; [L73] SORT_1 input_106; [L74] SORT_1 input_120; [L75] SORT_1 input_122; [L76] SORT_1 input_137; [L77] SORT_1 input_138; [L78] SORT_1 input_139; [L80] EXPR __VERIFIER_nondet_ushort() & mask_SORT_7 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L80] SORT_7 state_9 = __VERIFIER_nondet_ushort() & mask_SORT_7; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L81] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L82] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L83] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L84] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L85] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L86] SORT_1 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L87] SORT_1 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L88] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L89] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L90] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L91] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] SORT_7 init_10_arg_1 = var_8; [L94] state_9 = init_10_arg_1 [L95] SORT_1 init_25_arg_1 = var_23; [L96] state_24 = init_25_arg_1 [L97] SORT_1 init_27_arg_1 = var_23; [L98] state_26 = init_27_arg_1 [L99] SORT_1 init_42_arg_1 = var_23; [L100] state_41 = init_42_arg_1 [L101] SORT_1 init_44_arg_1 = var_23; [L102] state_43 = init_44_arg_1 [L103] SORT_1 init_52_arg_1 = var_19; [L104] state_51 = init_52_arg_1 [L105] SORT_1 init_59_arg_1 = var_23; [L106] state_58 = init_59_arg_1 [L107] SORT_1 init_61_arg_1 = var_23; [L108] state_60 = init_61_arg_1 [L109] SORT_1 init_63_arg_1 = var_23; [L110] state_62 = init_63_arg_1 [L111] SORT_1 init_65_arg_1 = var_23; [L112] state_64 = init_65_arg_1 [L113] SORT_1 init_69_arg_1 = var_23; [L114] state_68 = init_69_arg_1 [L115] SORT_1 init_71_arg_1 = var_23; [L116] state_70 = init_71_arg_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L119] input_2 = __VERIFIER_nondet_uchar() [L120] input_4 = __VERIFIER_nondet_uchar() [L121] input_5 = __VERIFIER_nondet_uchar() [L122] input_6 = __VERIFIER_nondet_uchar() [L123] input_28 = __VERIFIER_nondet_uchar() [L124] input_31 = __VERIFIER_nondet_uchar() [L125] input_33 = __VERIFIER_nondet_uchar() [L126] input_35 = __VERIFIER_nondet_uchar() [L127] input_37 = __VERIFIER_nondet_uchar() [L128] input_39 = __VERIFIER_nondet_uchar() [L129] input_45 = __VERIFIER_nondet_uchar() [L130] input_47 = __VERIFIER_nondet_uchar() [L131] input_49 = __VERIFIER_nondet_uchar() [L132] input_53 = __VERIFIER_nondet_uchar() [L133] input_56 = __VERIFIER_nondet_uchar() [L134] input_66 = __VERIFIER_nondet_uchar() [L135] input_72 = __VERIFIER_nondet_ushort() [L136] input_86 = __VERIFIER_nondet_uchar() [L137] input_92 = __VERIFIER_nondet_uchar() [L138] input_98 = __VERIFIER_nondet_uchar() [L139] input_104 = __VERIFIER_nondet_uchar() [L140] input_105 = __VERIFIER_nondet_uchar() [L141] input_106 = __VERIFIER_nondet_uchar() [L142] input_120 = __VERIFIER_nondet_uchar() [L143] input_122 = __VERIFIER_nondet_uchar() [L144] input_137 = __VERIFIER_nondet_uchar() [L145] input_138 = __VERIFIER_nondet_uchar() [L146] input_139 = __VERIFIER_nondet_uchar() [L149] SORT_7 var_12_arg_0 = state_9; [L150] SORT_11 var_12 = var_12_arg_0 >> 8; [L151] SORT_11 var_14_arg_0 = var_12; VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_14_arg_0=0, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L152] EXPR var_14_arg_0 & mask_SORT_11 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L152] var_14_arg_0 = var_14_arg_0 & mask_SORT_11 [L153] SORT_13 var_14 = var_14_arg_0; [L154] SORT_13 var_16_arg_0 = var_14; [L155] SORT_13 var_16_arg_1 = var_15; [L156] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L157] SORT_1 var_20_arg_0 = var_16; [L158] SORT_1 var_20 = ~var_20_arg_0; [L159] SORT_1 var_21_arg_0 = var_19; [L160] SORT_1 var_21_arg_1 = var_20; VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_15=0, var_19=1, var_21_arg_0=1, var_21_arg_1=-2, var_23=0, var_74=1, var_78=104, var_8=0] [L161] EXPR var_21_arg_0 & var_21_arg_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L161] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L162] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, mask_SORT_7=1023, state_24=0, state_26=0, state_41=0, state_43=0, state_51=1, state_58=0, state_60=0, state_62=0, state_64=0, state_68=0, state_70=0, state_9=0, var_15=0, var_19=1, var_23=0, var_74=1, var_78=104, var_8=0] [L162] var_21 = var_21 & mask_SORT_1 [L163] SORT_1 bad_22_arg_0 = var_21; [L164] CALL __VERIFIER_assert(!(bad_22_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 189 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 1189 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 741 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 448 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 22:44:29,706 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 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.vcegar_QF_BV_itc99_b13_p03.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 3b705ca0c5b5371dfb056caad606a25fce2d2b74615677865ff593635c093e46 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:44:31,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:44:31,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:44:31,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:44:31,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:44:31,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:44:31,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:44:31,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:44:31,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:44:31,627 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:44:31,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:44:31,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:44:31,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:44:31,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:44:31,628 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:44:31,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:44:31,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:44:31,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:44:31,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:44:31,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:44:31,630 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:44:31,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:44:31,630 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:44:31,630 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:44:31,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:44:31,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:44:31,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:44:31,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:44:31,630 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 -> 3b705ca0c5b5371dfb056caad606a25fce2d2b74615677865ff593635c093e46 [2025-03-16 22:44:31,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:44:31,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:44:31,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:44:31,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:44:31,873 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:44:31,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c [2025-03-16 22:44:32,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d1a8f55/6978d52857f3443d84f7ab150533ae2d/FLAG85f927a0b [2025-03-16 22:44:33,216 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:44:33,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c [2025-03-16 22:44:33,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d1a8f55/6978d52857f3443d84f7ab150533ae2d/FLAG85f927a0b [2025-03-16 22:44:33,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d1a8f55/6978d52857f3443d84f7ab150533ae2d [2025-03-16 22:44:33,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:44:33,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:44:33,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:44:33,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:44:33,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:44:33,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48382b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33, skipping insertion in model container [2025-03-16 22:44:33,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:44:33,384 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.vcegar_QF_BV_itc99_b13_p03.c[1266,1279] [2025-03-16 22:44:33,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:44:33,462 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:44:33,470 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.vcegar_QF_BV_itc99_b13_p03.c[1266,1279] [2025-03-16 22:44:33,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:44:33,521 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:44:33,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33 WrapperNode [2025-03-16 22:44:33,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:44:33,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:44:33,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:44:33,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:44:33,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,560 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 442 [2025-03-16 22:44:33,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:44:33,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:44:33,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:44:33,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:44:33,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,584 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-16 22:44:33,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,592 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:44:33,602 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:44:33,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:44:33,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:44:33,603 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (1/1) ... [2025-03-16 22:44:33,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:44:33,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:44:33,626 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-16 22:44:33,629 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-16 22:44:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:44:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:44:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:44:33,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:44:33,780 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:44:33,781 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:44:34,066 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-03-16 22:44:34,066 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:44:34,074 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:44:34,075 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:44:34,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:44:34 BoogieIcfgContainer [2025-03-16 22:44:34,075 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:44:34,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:44:34,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:44:34,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:44:34,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:44:33" (1/3) ... [2025-03-16 22:44:34,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d57ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:44:34, skipping insertion in model container [2025-03-16 22:44:34,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:33" (2/3) ... [2025-03-16 22:44:34,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d57ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:44:34, skipping insertion in model container [2025-03-16 22:44:34,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:44:34" (3/3) ... [2025-03-16 22:44:34,083 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c [2025-03-16 22:44:34,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:44:34,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p03.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:44:34,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:44:34,133 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;@3748a276, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:44:34,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:44:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:44:34,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:34,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:44:34,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:34,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:44:34,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:44:34,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542668985] [2025-03-16 22:44:34,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:34,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:44:34,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:44:34,157 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-16 22:44:34,158 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-16 22:44:34,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:44:34,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:44:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:34,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 22:44:34,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:44:34,459 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-16 22:44:34,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:44:34,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:44:34,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542668985] [2025-03-16 22:44:34,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542668985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:34,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:34,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:44:34,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602708955] [2025-03-16 22:44:34,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:34,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:44:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:44:34,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:44:34,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:44:34,479 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:34,525 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 22:44:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:44:34,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-16 22:44:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:34,531 INFO L225 Difference]: With dead ends: 16 [2025-03-16 22:44:34,531 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 22:44:34,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:44:34,535 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:34,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:44:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 22:44:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 22:44:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:44:34,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:44:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:34,556 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:44:34,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:44:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:44:34,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:34,556 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:44:34,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 22:44:34,761 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-16 22:44:34,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:34,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:44:34,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:44:34,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [913167961] [2025-03-16 22:44:34,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:34,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:44:34,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:44:34,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:44:34,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 22:44:34,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:44:34,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:44:34,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:34,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:34,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 22:44:34,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:44:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:44:35,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:44:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:44:35,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:44:35,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913167961] [2025-03-16 22:44:35,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913167961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:44:35,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:44:35,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 22:44:35,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959517131] [2025-03-16 22:44:35,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:44:35,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:44:35,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:44:35,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:44:35,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:44:35,607 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:35,689 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-16 22:44:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:44:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 22:44:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:35,690 INFO L225 Difference]: With dead ends: 14 [2025-03-16 22:44:35,690 INFO L226 Difference]: Without dead ends: 12 [2025-03-16 22:44:35,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:44:35,691 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:35,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:44:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-16 22:44:35,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-16 22:44:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-16 22:44:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 22:44:35,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 22:44:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:35,693 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 22:44:35,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 22:44:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 22:44:35,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:35,694 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 22:44:35,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 22:44:35,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:44:35,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:35,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 22:44:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:44:35,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719314076] [2025-03-16 22:44:35,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:44:35,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:44:35,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:44:35,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:44:35,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 22:44:36,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-16 22:44:36,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 22:44:36,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 22:44:36,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:36,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-16 22:44:36,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:44:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:44:42,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:44:53,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse94 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_62~0#1|)))))) (.cse71 ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_9~0#1|)) (.cse75 (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_15|)))) .cse23))))) (.cse76 (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_15|))))))))) (.cse77 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_11~0#1|)) (.cse73 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_8~0#1|)))))))) (.cse65 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_23~0#1|))))))) (let ((.cse28 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_58~0#1|)) (.cse31 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse65)))) .cse23)) (_ bv0 8))) (.cse15 (let ((.cse96 (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse73 (_ bv8 32)))))))))) (and (or (not .cse96) .cse75) (or .cse96 .cse76)))) (.cse69 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16))) (let ((.cse95 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse73 .cse95)))) (= (_ bv0 32) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 .cse95)))))))) (.cse93 ((_ zero_extend 16) ((_ extract 15 0) .cse71))) (.cse8 (= |c_ULTIMATE.start_main_~state_62~0#1| (_ bv0 8))) (.cse41 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse23 .cse94))))) (let ((.cse34 (= |c_ULTIMATE.start_main_~state_70~0#1| (_ bv0 8))) (.cse27 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse94)))))))) (.cse42 (not .cse41)) (.cse12 (not .cse8)) (.cse16 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse93)))))))))))) (_ bv8 32)))))))))) .cse75) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse93)))))))))))) (_ bv8 32))))))))) .cse76))) (.cse18 (let ((.cse92 (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse93)) (_ bv8 32)))))))))) (and (or .cse92 .cse76) (or .cse75 (not .cse92))))) (.cse14 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16))) (= (_ bv0 32) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))))))) (.cse20 (and (or .cse76 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse89 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse88 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse73 .cse89))))) (or (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse88 |ULTIMATE.start_main_~var_74~0#1|))))))))) (_ bv8 32)))))))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 .cse89))) .cse88)))))) (or .cse15 .cse69) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse90 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse91 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse73 .cse90))))) (or (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 .cse90))) .cse91) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse91 |ULTIMATE.start_main_~var_74~0#1|))))))))) (_ bv8 32))))))))))))) .cse75))) (.cse21 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse85 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse84 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 .cse85))))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| .cse84))))))))) .cse85))) .cse84)))) .cse15) (or .cse76 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse86 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 .cse86)))))))))))) .cse86))))))))))))) (_ bv8 32)))))))))) (or .cse75 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse87 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 .cse87)))))))))))) .cse87))))))))))))) (_ bv8 32))))))))))))) (.cse22 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse79 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse80 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 .cse79))))) (let ((.cse78 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| .cse80))))))))))) (or (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse78 .cse79))) .cse80) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse78)) (_ bv8 32)))))))))))))) .cse75) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))))))))))))))) (_ bv8 32)))))))))) .cse75) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (let ((.cse82 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse83 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 .cse82))))) (let ((.cse81 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| .cse83))))))))))) (or (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse81)) (_ bv8 32)))))))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse81 .cse82))) .cse83)))))) .cse76) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~var_74~0#1| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_74~0#1| ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))))))))))))))) (_ bv8 32))))))))) .cse76))) (.cse19 (let ((.cse70 (let ((.cse74 (= |c_ULTIMATE.start_main_~var_15~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 16) ((_ extract 15 0) .cse73)) (_ bv8 32)))) .cse77)))))) (and (or (not .cse74) .cse75) (or .cse76 .cse74))))) (and (or .cse69 .cse70) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 16))) (let ((.cse72 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (bvule ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse71 .cse72))) ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse73 .cse72)))))) .cse70)))) (.cse50 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse68 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse68))) .cse23)) (_ bv0 8))) (not (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse68)))))) (_ bv0 8))))))) (.cse30 (not .cse31)) (.cse9 (not .cse28))) (let ((.cse33 (forall ((|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))) (_ bv0 8))))) (.cse35 (let ((.cse60 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse23)))))) (.cse59 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse67 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse67))) .cse23)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse67))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse23))))))) (.cse57 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse66))) .cse23)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse66))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse23))))))) (.cse61 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse23)))))) (.cse62 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse23 .cse65))))) (let ((.cse55 (and (or (and (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse63 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))))) (or (= ((_ extract 7 0) (bvand .cse23 .cse63)) (_ bv0 8)) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse63))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse23))))))) (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse64 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse64))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse23)))) (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) .cse64)))) (_ bv0 8))))) (or .cse31 .cse57) (or .cse31 .cse59)) .cse28) (or (and (or .cse62 .cse60) (or .cse62 .cse59) (or .cse62 .cse57) (or .cse61 .cse62)) .cse9))) (.cse56 (and (or (let ((.cse58 (not .cse62))) (and (or .cse57 .cse58) (or .cse59 .cse58) (or .cse60 .cse58) (or .cse61 .cse58))) .cse9) (or (and (or .cse30 .cse59) .cse50 (or .cse30 .cse57)) .cse28)))) (and (or .cse12 (and (or .cse55 .cse16) (or .cse56 .cse18) (or .cse56 .cse18 .cse14) (or .cse14 .cse15 .cse55))) (or (and (or .cse20 .cse55) (or .cse21 .cse55) (or .cse56 .cse22) (or .cse56 .cse19)) .cse8))))) (.cse36 (forall ((|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))) (_ bv0 8)))) (.cse7 (and (or .cse41 .cse21) (or .cse41 .cse20) (or .cse19 .cse42) (or .cse22 .cse42))) (.cse32 (and (or .cse22 .cse30) (or .cse30 .cse19) (or .cse31 .cse21) (or .cse31 .cse20))) (.cse0 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))) .cse23)) (_ bv0 8)))) (.cse26 (not .cse27)) (.cse40 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|)))))) .cse23)) (_ bv0 8))))) (.cse3 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))))))) (.cse4 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (let ((.cse54 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|))))) (or (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse54))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))) (_ bv0 8)) (not (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse54))))) (_ bv0 8))))))) (.cse1 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse53))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse53))))) (_ bv0 8))))))) (.cse5 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_68~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_68~0#1|)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))) (_ bv0 8))))) (.cse29 (not .cse34))) (and (or (let ((.cse6 (or .cse18 .cse12))) (and (or .cse0 (let ((.cse2 (and .cse6 (or .cse7 .cse8)))) (and (or .cse1 .cse2) (or .cse2 .cse3) (or .cse4 .cse2) (or .cse5 .cse2))) .cse9) (or (let ((.cse10 (and .cse6 (or (and (or .cse19 .cse26) (or .cse21 .cse27) (or .cse22 .cse26) (or .cse20 .cse27)) .cse8))) (.cse11 (let ((.cse13 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse25)))))) (_ bv0 8)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse25))) .cse23)) (_ bv0 8)))))) (.cse17 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse24)))))) (_ bv0 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse24))) .cse23)) (_ bv0 8))))))) (and (or .cse12 (and (or .cse13 .cse14 .cse15) (or .cse13 .cse16) (or .cse17 .cse18) (or .cse17 .cse18 .cse14))) (or (and (or .cse17 .cse19) (or .cse13 .cse20) (or .cse13 .cse21) (or .cse17 .cse22)) .cse8))))) (and (or .cse10 .cse4 .cse0) (or .cse10 .cse1 .cse0) (or .cse3 .cse11) (or .cse5 .cse11))) .cse28))) .cse29) (or (and (or .cse12 (and (or .cse18 .cse14 .cse30) (or .cse18 .cse30) (or .cse31 .cse14 .cse15) (or .cse31 .cse16))) (or .cse32 .cse8)) .cse33 .cse0 .cse34) (or .cse33 .cse35 .cse34) (or .cse36 (and (or .cse35 .cse34) (or (let ((.cse39 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))))) (or (= ((_ extract 7 0) (bvand .cse23 .cse45)) (_ bv0 8)) (not (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse45)))))))) (_ bv0 8))))))) (.cse43 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse44 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))))))) (or (not (= ((_ extract 7 0) (bvand .cse23 .cse44)) (_ bv0 8))) (not (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse44)))))))) (_ bv0 8)))))))) (and (or (let ((.cse37 (and (or .cse40 .cse42) (or .cse43 .cse28))) (.cse38 (and (or .cse28 .cse39) (or .cse40 .cse41)))) (and (or .cse22 .cse37) (or .cse20 .cse38) (or .cse37 .cse19) (or .cse21 .cse38))) .cse8) (or .cse12 (and (or (and (or .cse14 .cse15 .cse39) (or .cse18 .cse43) (or .cse39 .cse16) (or .cse18 .cse43 .cse14)) .cse28) (or .cse40 .cse18))))) .cse29))) (or .cse36 (and (or .cse12 (let ((.cse46 (and .cse30 .cse29))) (and (or .cse31 .cse34 .cse16) (or .cse18 .cse14 .cse46) (or .cse18 .cse46) (or .cse31 .cse14 .cse15 .cse34)))) (or (and (or .cse7 .cse29) (or .cse32 .cse34)) .cse8)) .cse0) (or (let ((.cse49 (forall ((|ULTIMATE.start_main_~var_19~0#1| (_ BitVec 8))) (let ((.cse52 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_19~0#1|))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse52))) .cse23)) (_ bv0 8))) (= ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse52)))))) (_ bv0 8))))))) (and (or (let ((.cse47 (and (or .cse28 (and (or .cse40 .cse4 .cse26) (or .cse40 .cse1 .cse26) (or .cse5 .cse50) (or .cse50 .cse3))) (or .cse40 (and (or .cse4 .cse42) (or .cse1 .cse42) (or .cse5 .cse42) (or .cse3 .cse42)) .cse9))) (.cse48 (and (or .cse40 (and (or .cse1 .cse41) (or .cse41 .cse5) (or .cse4 .cse41) (or .cse41 .cse3)) .cse9) (or (and (or .cse40 .cse4 .cse27) (or .cse5 .cse49) (or .cse40 .cse1 .cse27) (or .cse3 .cse49)) .cse28)))) (and (or .cse22 .cse47) (or .cse47 .cse19) (or .cse20 .cse48) (or .cse21 .cse48))) .cse8) (or .cse12 (and (or (let ((.cse51 (and (or .cse14 .cse49 .cse15) (or .cse49 .cse16) (or .cse18 .cse50) (or .cse18 .cse14 .cse50)))) (and (or .cse40 .cse18 .cse4) (or .cse40 .cse18 .cse1) (or .cse5 .cse51) (or .cse3 .cse51))) .cse28) (or .cse40 (and (or .cse18 .cse3) (or .cse18 .cse4) (or .cse18 .cse1) (or .cse18 .cse5)) .cse9))))) .cse29))))))) is different from false