./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7edbd2d714654fb3cac877a34ec7b56a1dc045c2b1f9c322f5dfaacff9b2ba72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:09:35,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:09:35,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:09:35,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:09:35,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:09:35,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:09:35,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:09:35,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:09:35,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:09:35,674 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:09:35,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:09:35,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:09:35,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:09:35,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:09:35,675 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:09:35,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:09:35,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:09:35,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:09:35,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:09:35,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:09:35,680 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:09:35,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:09:35,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:09:35,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:09:35,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:09:35,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:09:35,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:09:35,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:09:35,681 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7edbd2d714654fb3cac877a34ec7b56a1dc045c2b1f9c322f5dfaacff9b2ba72 [2025-02-08 00:09:36,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:09:36,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:09:36,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:09:36,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:09:36,046 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:09:36,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-02-08 00:09:37,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20f39177a/fda7a6d3fadd4a8cbcabad0e4112b46a/FLAG42c25bc43 [2025-02-08 00:09:37,652 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:09:37,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-02-08 00:09:37,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20f39177a/fda7a6d3fadd4a8cbcabad0e4112b46a/FLAG42c25bc43 [2025-02-08 00:09:37,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20f39177a/fda7a6d3fadd4a8cbcabad0e4112b46a [2025-02-08 00:09:37,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:09:37,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:09:37,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:09:37,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:09:37,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:09:37,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:09:37" (1/1) ... [2025-02-08 00:09:37,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44200c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:37, skipping insertion in model container [2025-02-08 00:09:37,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:09:37" (1/1) ... [2025-02-08 00:09:37,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:09:37,880 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c[1266,1279] [2025-02-08 00:09:38,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:09:38,059 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:09:38,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c[1266,1279] [2025-02-08 00:09:38,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:09:38,168 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:09:38,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38 WrapperNode [2025-02-08 00:09:38,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:09:38,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:09:38,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:09:38,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:09:38,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,317 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 729 [2025-02-08 00:09:38,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:09:38,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:09:38,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:09:38,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:09:38,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,384 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:09:38,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:09:38,482 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:09:38,482 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:09:38,482 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:09:38,483 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (1/1) ... [2025-02-08 00:09:38,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:09:38,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:38,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:09:38,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:09:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:09:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:09:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:09:38,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:09:38,707 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:09:38,709 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:09:39,684 INFO L? ?]: Removed 377 outVars from TransFormulas that were not future-live. [2025-02-08 00:09:39,684 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:09:39,729 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:09:39,729 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:09:39,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:39 BoogieIcfgContainer [2025-02-08 00:09:39,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:09:39,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:09:39,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:09:39,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:09:39,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:09:37" (1/3) ... [2025-02-08 00:09:39,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5022dcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:09:39, skipping insertion in model container [2025-02-08 00:09:39,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:38" (2/3) ... [2025-02-08 00:09:39,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5022dcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:09:39, skipping insertion in model container [2025-02-08 00:09:39,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:39" (3/3) ... [2025-02-08 00:09:39,744 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-02-08 00:09:39,761 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:09:39,763 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c that has 1 procedures, 140 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:09:39,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:09:39,841 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;@5f50b7ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:09:39,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:09:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.5) internal successors, (207), 139 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 00:09:39,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:39,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:39,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:39,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1168482644, now seen corresponding path program 1 times [2025-02-08 00:09:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:39,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017212027] [2025-02-08 00:09:39,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:39,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 00:09:40,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 00:09:40,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:40,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:40,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017212027] [2025-02-08 00:09:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017212027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:40,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:40,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:40,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216040512] [2025-02-08 00:09:40,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:40,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:09:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:40,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:09:40,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:40,665 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.5) internal successors, (207), 139 states have internal predecessors, (207), 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 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:40,964 INFO L93 Difference]: Finished difference Result 227 states and 337 transitions. [2025-02-08 00:09:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:09:40,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2025-02-08 00:09:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:40,974 INFO L225 Difference]: With dead ends: 227 [2025-02-08 00:09:40,975 INFO L226 Difference]: Without dead ends: 140 [2025-02-08 00:09:40,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:40,984 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:40,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:09:41,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-08 00:09:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-08 00:09:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4820143884892085) internal successors, (206), 139 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2025-02-08 00:09:41,041 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 40 [2025-02-08 00:09:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:41,041 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2025-02-08 00:09:41,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2025-02-08 00:09:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 00:09:41,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:41,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:41,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:09:41,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:41,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1858544348, now seen corresponding path program 1 times [2025-02-08 00:09:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670616596] [2025-02-08 00:09:41,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:41,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 00:09:41,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 00:09:41,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:41,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:41,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:41,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670616596] [2025-02-08 00:09:41,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670616596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:41,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:41,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:41,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637106055] [2025-02-08 00:09:41,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:41,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:09:41,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:41,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:09:41,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:41,297 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:41,424 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2025-02-08 00:09:41,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:09:41,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2025-02-08 00:09:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:41,426 INFO L225 Difference]: With dead ends: 229 [2025-02-08 00:09:41,427 INFO L226 Difference]: Without dead ends: 142 [2025-02-08 00:09:41,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:41,429 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:41,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-08 00:09:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-02-08 00:09:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2025-02-08 00:09:41,442 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 41 [2025-02-08 00:09:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:41,443 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2025-02-08 00:09:41,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2025-02-08 00:09:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 00:09:41,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:41,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:41,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:09:41,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:41,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:41,445 INFO L85 PathProgramCache]: Analyzing trace with hash 151209383, now seen corresponding path program 1 times [2025-02-08 00:09:41,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:41,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361961272] [2025-02-08 00:09:41,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:41,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 00:09:41,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 00:09:41,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:41,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:41,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:41,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361961272] [2025-02-08 00:09:41,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361961272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:41,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:41,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:09:41,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690261909] [2025-02-08 00:09:41,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:41,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:09:41,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:41,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:09:41,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:09:41,979 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:42,212 INFO L93 Difference]: Finished difference Result 235 states and 343 transitions. [2025-02-08 00:09:42,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:09:42,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2025-02-08 00:09:42,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:42,215 INFO L225 Difference]: With dead ends: 235 [2025-02-08 00:09:42,215 INFO L226 Difference]: Without dead ends: 146 [2025-02-08 00:09:42,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:09:42,216 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 178 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:42,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 604 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:09:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-08 00:09:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-02-08 00:09:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2025-02-08 00:09:42,234 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 42 [2025-02-08 00:09:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:42,234 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2025-02-08 00:09:42,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2025-02-08 00:09:42,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 00:09:42,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:42,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:42,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:09:42,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:42,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:42,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2014081111, now seen corresponding path program 1 times [2025-02-08 00:09:42,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:42,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320775442] [2025-02-08 00:09:42,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:42,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:42,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 00:09:42,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 00:09:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:42,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:42,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320775442] [2025-02-08 00:09:42,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320775442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:42,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:42,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:09:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038614046] [2025-02-08 00:09:42,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:42,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:09:42,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:42,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:09:42,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:09:42,746 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:43,001 INFO L93 Difference]: Finished difference Result 241 states and 349 transitions. [2025-02-08 00:09:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:09:43,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2025-02-08 00:09:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:43,003 INFO L225 Difference]: With dead ends: 241 [2025-02-08 00:09:43,003 INFO L226 Difference]: Without dead ends: 149 [2025-02-08 00:09:43,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:09:43,004 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 171 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:43,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 758 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:09:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-08 00:09:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2025-02-08 00:09:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2025-02-08 00:09:43,022 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 43 [2025-02-08 00:09:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:43,022 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2025-02-08 00:09:43,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2025-02-08 00:09:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 00:09:43,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:43,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:43,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:09:43,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:43,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash 627182593, now seen corresponding path program 1 times [2025-02-08 00:09:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:43,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382348878] [2025-02-08 00:09:43,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:43,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 00:09:43,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 00:09:43,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:43,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:09:43,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:09:43,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 00:09:43,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 00:09:43,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:43,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:09:43,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:09:43,172 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:09:43,173 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:09:43,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:09:43,179 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 00:09:43,223 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:09:43,242 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:09:43,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:09:43 BoogieIcfgContainer [2025-02-08 00:09:43,249 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:09:43,250 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:09:43,250 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:09:43,251 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:09:43,252 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:39" (3/4) ... [2025-02-08 00:09:43,254 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:09:43,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:09:43,256 INFO L158 Benchmark]: Toolchain (without parser) took 5577.39ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 56.6MB in the end (delta: 73.3MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2025-02-08 00:09:43,256 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 192.9MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:43,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.76ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 108.5MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:09:43,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 145.26ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 95.0MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:09:43,258 INFO L158 Benchmark]: Boogie Preprocessor took 163.05ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 87.0MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:09:43,258 INFO L158 Benchmark]: IcfgBuilder took 1247.84ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 85.5MB in the end (delta: 1.5MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2025-02-08 00:09:43,258 INFO L158 Benchmark]: TraceAbstraction took 3514.91ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 56.6MB in the end (delta: 28.0MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2025-02-08 00:09:43,258 INFO L158 Benchmark]: Witness Printer took 4.87ms. Allocated memory is still 167.8MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 21.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:43,262 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.19ms. Allocated memory is still 192.9MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.76ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 108.5MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 145.26ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 95.0MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 163.05ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 87.0MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1247.84ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 85.5MB in the end (delta: 1.5MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3514.91ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 56.6MB in the end (delta: 28.0MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Witness Printer took 4.87ms. Allocated memory is still 167.8MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 21.5kB). 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 168. 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_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 4); [L36] const SORT_31 msb_SORT_31 = (SORT_31)1 << (4 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 10); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_21 = 1; [L44] const SORT_67 var_68 = 0; [L45] const SORT_10 var_119 = 104; [L46] const SORT_10 var_136 = 1; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_29; [L53] SORT_31 input_32; [L54] SORT_31 input_34; [L55] SORT_1 input_36; [L56] SORT_1 input_38; [L57] SORT_1 input_44; [L58] SORT_1 input_46; [L59] SORT_1 input_48; [L60] SORT_3 input_52; [L61] SORT_1 input_55; [L62] SORT_1 input_63; [L63] SORT_1 input_73; [L64] SORT_1 input_79; [L65] SORT_1 input_81; [L66] SORT_1 input_95; [L67] SORT_1 input_101; [L68] SORT_1 input_107; [L69] SORT_1 input_113; [L70] SORT_1 input_114; [L71] SORT_1 input_115; [L72] SORT_67 input_134; [L73] SORT_1 input_143; [L74] SORT_1 input_144; [L75] SORT_1 input_145; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L77] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L78] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L79] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L80] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L81] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L82] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L83] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L84] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L85] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L86] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L87] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_ushort() & mask_SORT_67 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L88] SORT_67 state_69 = __VERIFIER_nondet_ushort() & mask_SORT_67; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L89] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] SORT_1 init_9_arg_1 = var_7; [L92] state_8 = init_9_arg_1 [L93] SORT_1 init_15_arg_1 = var_7; [L94] state_14 = init_15_arg_1 [L95] SORT_1 init_26_arg_1 = var_7; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_28_arg_1 = var_7; [L98] state_27 = init_28_arg_1 [L99] SORT_1 init_41_arg_1 = var_7; [L100] state_40 = init_41_arg_1 [L101] SORT_1 init_43_arg_1 = var_7; [L102] state_42 = init_43_arg_1 [L103] SORT_1 init_51_arg_1 = var_21; [L104] state_50 = init_51_arg_1 [L105] SORT_1 init_58_arg_1 = var_7; [L106] state_57 = init_58_arg_1 [L107] SORT_1 init_60_arg_1 = var_7; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_62_arg_1 = var_7; [L110] state_61 = init_62_arg_1 [L111] SORT_1 init_66_arg_1 = var_7; [L112] state_65 = init_66_arg_1 [L113] SORT_67 init_70_arg_1 = var_68; [L114] state_69 = init_70_arg_1 [L115] SORT_1 init_72_arg_1 = var_7; [L116] state_71 = init_72_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=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_29 = __VERIFIER_nondet_uchar() [L124] input_32 = __VERIFIER_nondet_uchar() [L125] input_34 = __VERIFIER_nondet_uchar() [L126] input_36 = __VERIFIER_nondet_uchar() [L127] input_38 = __VERIFIER_nondet_uchar() [L128] input_44 = __VERIFIER_nondet_uchar() [L129] input_46 = __VERIFIER_nondet_uchar() [L130] input_48 = __VERIFIER_nondet_uchar() [L131] input_52 = __VERIFIER_nondet_uchar() [L132] input_55 = __VERIFIER_nondet_uchar() [L133] input_63 = __VERIFIER_nondet_uchar() [L134] input_73 = __VERIFIER_nondet_uchar() [L135] input_79 = __VERIFIER_nondet_uchar() [L136] input_81 = __VERIFIER_nondet_uchar() [L137] input_95 = __VERIFIER_nondet_uchar() [L138] input_101 = __VERIFIER_nondet_uchar() [L139] input_107 = __VERIFIER_nondet_uchar() [L140] input_113 = __VERIFIER_nondet_uchar() [L141] input_114 = __VERIFIER_nondet_uchar() [L142] input_115 = __VERIFIER_nondet_uchar() [L143] input_134 = __VERIFIER_nondet_ushort() [L144] input_143 = __VERIFIER_nondet_uchar() [L145] input_144 = __VERIFIER_nondet_uchar() [L146] input_145 = __VERIFIER_nondet_uchar() [L149] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_11_arg_0=0, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L150] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L150] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L151] SORT_10 var_11 = var_11_arg_0; [L152] SORT_10 var_13_arg_0 = var_11; [L153] SORT_10 var_13_arg_1 = var_12; [L154] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L155] SORT_1 var_16_arg_0 = state_14; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_13=1, var_16_arg_0=0, var_21=1, var_68=0, var_7=0] [L156] EXPR var_16_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_13=1, var_21=1, var_68=0, var_7=0] [L156] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L157] SORT_10 var_16 = var_16_arg_0; [L158] SORT_10 var_17_arg_0 = var_16; [L159] SORT_10 var_17_arg_1 = var_12; [L160] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L161] SORT_1 var_18_arg_0 = var_13; [L162] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_68=0, var_7=0] [L163] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L163] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L164] SORT_1 var_22_arg_0 = var_18; [L165] SORT_1 var_22 = ~var_22_arg_0; [L166] SORT_1 var_23_arg_0 = var_21; [L167] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_68=0, var_7=0] [L168] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L168] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L169] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_119=104, var_12=0, var_136=1, var_21=1, var_68=0, var_7=0] [L169] var_23 = var_23 & mask_SORT_1 [L170] SORT_1 bad_24_arg_0 = var_23; [L171] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 2363 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1717 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 698 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 646 mSDtfsCounter, 698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 386 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:09:43,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7edbd2d714654fb3cac877a34ec7b56a1dc045c2b1f9c322f5dfaacff9b2ba72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:09:45,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:09:45,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:09:45,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:09:45,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:09:45,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:09:45,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:09:45,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:09:45,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:09:45,945 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:09:45,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:09:45,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:09:45,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:09:45,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:09:45,946 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:09:45,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:09:45,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:09:45,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:09:45,947 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:09:45,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:09:45,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:09:45,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:09:45,948 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:09:45,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:09:45,948 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:09:45,948 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:09:45,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:09:45,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:09:45,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:09:45,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:09:45,948 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7edbd2d714654fb3cac877a34ec7b56a1dc045c2b1f9c322f5dfaacff9b2ba72 [2025-02-08 00:09:46,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:09:46,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:09:46,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:09:46,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:09:46,318 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:09:46,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-02-08 00:09:47,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cf4d5221/095ba14f481e4e55ba597bebe3afaaeb/FLAG9a6c66073 [2025-02-08 00:09:48,139 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:09:48,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-02-08 00:09:48,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cf4d5221/095ba14f481e4e55ba597bebe3afaaeb/FLAG9a6c66073 [2025-02-08 00:09:48,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cf4d5221/095ba14f481e4e55ba597bebe3afaaeb [2025-02-08 00:09:48,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:09:48,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:09:48,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:09:48,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:09:48,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:09:48,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f12dd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48, skipping insertion in model container [2025-02-08 00:09:48,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:09:48,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c[1266,1279] [2025-02-08 00:09:48,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:09:48,524 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:09:48,538 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c[1266,1279] [2025-02-08 00:09:48,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:09:48,641 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:09:48,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48 WrapperNode [2025-02-08 00:09:48,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:09:48,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:09:48,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:09:48,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:09:48,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,706 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 465 [2025-02-08 00:09:48,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:09:48,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:09:48,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:09:48,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:09:48,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,752 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:09:48,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,772 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:09:48,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:09:48,788 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:09:48,788 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:09:48,791 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (1/1) ... [2025-02-08 00:09:48,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:09:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:48,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:09:48,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:09:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:09:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:09:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:09:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:09:48,984 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:09:48,986 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:09:49,397 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-02-08 00:09:49,399 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:09:49,411 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:09:49,412 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:09:49,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:49 BoogieIcfgContainer [2025-02-08 00:09:49,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:09:49,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:09:49,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:09:49,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:09:49,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:09:48" (1/3) ... [2025-02-08 00:09:49,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74165244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:09:49, skipping insertion in model container [2025-02-08 00:09:49,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:48" (2/3) ... [2025-02-08 00:09:49,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74165244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:09:49, skipping insertion in model container [2025-02-08 00:09:49,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:49" (3/3) ... [2025-02-08 00:09:49,426 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c [2025-02-08 00:09:49,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:09:49,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p13.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:09:49,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:09:49,511 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;@e269536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:09:49,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:09:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:09:49,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:49,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:09:49,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:49,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:09:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:09:49,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862737577] [2025-02-08 00:09:49,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:49,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:49,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:49,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:09:49,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:09:49,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:09:49,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:09:49,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:49,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:49,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 00:09:49,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:49,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:09:49,995 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:09:49,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862737577] [2025-02-08 00:09:49,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862737577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:49,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:49,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:09:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125625096] [2025-02-08 00:09:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:50,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:09:50,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:09:50,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:09:50,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:50,029 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:50,099 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:09:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:09:50,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 00:09:50,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:50,111 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:09:50,112 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:09:50,115 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-02-08 00:09:50,118 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-02-08 00:09:50,120 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-02-08 00:09:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:09:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:09:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:09:50,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:09:50,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:50,151 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:09:50,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:09:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:09:50,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:50,152 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:09:50,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 00:09:50,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:50,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:50,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:50,354 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:09:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:09:50,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059977502] [2025-02-08 00:09:50,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:50,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:50,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:50,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:09:50,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:09:50,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:09:50,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:09:50,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:50,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:50,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 00:09:50,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:50,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:51,840 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:09:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059977502] [2025-02-08 00:09:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059977502] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:51,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:09:51,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 00:09:51,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041063037] [2025-02-08 00:09:51,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:51,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:09:51,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:09:51,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:09:51,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:09:51,843 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:51,966 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-08 00:09:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:09:51,966 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 00:09:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:51,967 INFO L225 Difference]: With dead ends: 14 [2025-02-08 00:09:51,967 INFO L226 Difference]: Without dead ends: 12 [2025-02-08 00:09:51,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:09:51,968 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:51,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-08 00:09:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-02-08 00:09:51,971 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-02-08 00:09:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-08 00:09:51,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-08 00:09:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:51,972 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-08 00:09:51,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-08 00:09:51,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 00:09:51,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:51,973 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-08 00:09:51,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 00:09:52,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:52,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:52,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-08 00:09:52,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:09:52,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533458514] [2025-02-08 00:09:52,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:09:52,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:52,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:52,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:09:52,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 00:09:52,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 00:09:52,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:09:52,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:09:52,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:52,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 00:09:52,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:52,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:57,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_~state_71~0#1| (_ bv0 8))) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse12 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_57~0#1|)) (.cse1 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_65~0#1_8| (_ 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) |v_ULTIMATE.start_main_~state_65~0#1_8|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse6)))))) (.cse2 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_65~0#1_8| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_65~0#1_8|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse6))))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|)))))) (.cse8 (not .cse9)) (.cse5 (forall ((|v_ULTIMATE.start_main_~var_23_arg_0~0#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_15|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_0~0#1_15|))))))))))))))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_23_arg_0~0#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_15|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_0~0#1_15|))))))))))))))) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_14~0#1|))))))) (and (or (let ((.cse0 (and (or (let ((.cse4 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse7))))))))) (and (or .cse3 .cse4) (or .cse5 (not .cse4)))) .cse8) (or .cse9 (let ((.cse10 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse11))))))))) (and (or .cse5 (not .cse10)) (or .cse10 .cse3))))))) (and (or .cse0 .cse1) (or .cse0 .cse2))) (not .cse12)) (or .cse12 (and (or .cse1 (let ((.cse13 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_21~0#1|)))))))))))))))) (and (or .cse13 .cse3) (or .cse5 (not .cse13))))) (or .cse2 (and (or (let ((.cse14 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse11))))))))))))) (and (or .cse3 .cse14) (or (not .cse14) .cse5))) .cse9) (or .cse8 (let ((.cse15 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse7)))))))))) |c_ULTIMATE.start_main_~var_12~0#1|))) (and (or .cse5 (not .cse15)) (or .cse3 .cse15))))))))))) is different from false [2025-02-08 00:10:22,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse87 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|))))) (let ((.cse88 ((_ zero_extend 24) ((_ extract 7 0) .cse87)))) (let ((.cse83 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse88))))) (.cse30 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse78 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse88)))) (.cse24 (= ((_ extract 7 0) (bvand .cse30 .cse87)) (_ bv0 8))) (.cse31 (forall ((|v_ULTIMATE.start_main_~var_23_arg_0~0#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_15|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_0~0#1_15|))))))))))))))) (.cse29 (forall ((|v_ULTIMATE.start_main_~var_23_arg_0~0#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_15|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_0~0#1_15|))))))))))))))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse83))))) (let ((.cse3 (let ((.cse86 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse48)))))) (and (or .cse31 .cse86) (or (not .cse86) .cse29)))) (.cse17 (not .cse24)) (.cse11 (let ((.cse85 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse78)))))) (and (or .cse29 (not .cse85)) (or .cse85 .cse31))))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_65~0#1_8| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_65~0#1_8|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse30))))) (.cse8 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_65~0#1_8| (_ 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) |v_ULTIMATE.start_main_~state_65~0#1_8|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse30)))))) (.cse21 (or .cse24 .cse11)) (.cse82 (or .cse17 (let ((.cse84 (= (_ bv0 32) |c_ULTIMATE.start_main_~var_12~0#1|))) (and (or .cse31 .cse84) (or .cse29 (not .cse84)))))) (.cse18 (or .cse24 .cse3))) (let ((.cse4 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse83)))))))) (.cse49 (= |c_ULTIMATE.start_main_~state_71~0#1| (_ bv0 8))) (.cse54 (and .cse82 .cse18)) (.cse5 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))) .cse30))))) (.cse10 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))) .cse30)))))) (.cse53 (let ((.cse81 (and .cse21 .cse82))) (and (or .cse0 .cse81) (or .cse8 .cse81)))) (.cse6 (or .cse8 (and (or .cse29 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse79 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse79 .cse30))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse79)))))))))) |c_ULTIMATE.start_main_~var_12~0#1|)))))) (or .cse31 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse80 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse80 .cse30))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse80)))))))))) |c_ULTIMATE.start_main_~var_12~0#1|)))))))) (.cse12 (= |c_ULTIMATE.start_main_~state_40~0#1| (_ bv0 8)))) (let ((.cse62 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_57~0#1|)) (.cse36 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_65~0#1_9| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse30 ((_ 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 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_65~0#1_9|))))))))))))) (.cse61 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_65~0#1_9| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse30 ((_ 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 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_65~0#1_9|)))))))))))) (.cse52 (or (and (or .cse0 .cse54 .cse5) (or .cse10 .cse53) .cse6) .cse12)) (.cse59 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_14~0#1|)))))) (.cse60 (not .cse49)) (.cse13 (not (= (_ bv0 8) |c_ULTIMATE.start_main_~state_14~0#1|))) (.cse23 (not .cse12)) (.cse28 (or .cse3 .cse4)) (.cse27 (or .cse4 .cse11)) (.cse1 (not .cse4))) (and (or (let ((.cse14 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_57~0#1|)))))))) (let ((.cse19 (not .cse14)) (.cse15 (or (and (or .cse29 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ 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_21~0#1|))))))))))))) |c_ULTIMATE.start_main_~var_12~0#1|)))) (or .cse31 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ 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_21~0#1|))))))))))))) |c_ULTIMATE.start_main_~var_12~0#1|)))) .cse8))) (and (or (let ((.cse2 (and (or .cse29 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ 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) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse34))))))))))))))) .cse30)))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse34 .cse30))))))) (or .cse31 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ 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) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse35))))))))))))))) .cse30))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse35 .cse30))))))))) (.cse9 (and (or .cse29 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse32))))))))))) .cse30)))))) |c_ULTIMATE.start_main_~var_12~0#1|)) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 .cse30)))))))) (or .cse31 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse33 .cse30)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse33))))))))))) .cse30)))))) |c_ULTIMATE.start_main_~var_12~0#1|))))))) (.cse22 (and (or .cse31 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ 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_21~0#1|)))))))))))))) .cse30)))))) |c_ULTIMATE.start_main_~var_12~0#1|))) (or .cse29 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ 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_21~0#1|)))))))))))))) .cse30)))))) |c_ULTIMATE.start_main_~var_12~0#1|)))))) (.cse16 (and (or .cse29 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ 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) ((_ extract 7 0) (bvand .cse30 ((_ 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_21~0#1|)))))))))))))))))) .cse30)))))))))) (or .cse31 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ 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) ((_ extract 7 0) (bvand .cse30 ((_ 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_21~0#1|)))))))))))))))))) .cse30)))))))))))) (and (or (let ((.cse7 (and (or .cse9 .cse1) (or .cse10 .cse4 .cse11)))) (and (or .cse0 (and (or .cse1 .cse2) (or .cse3 .cse4 .cse5))) .cse6 (or .cse7 .cse0) (or .cse7 .cse8))) .cse12) (or .cse13 (and (or (and (or .cse14 (and .cse15 (or .cse0 (and (or .cse16 .cse17) .cse18)))) (or .cse19 (let ((.cse20 (and .cse21 (or .cse22 .cse17)))) (and (or .cse20 .cse8) (or .cse0 .cse20))))) .cse23) (or .cse12 (let ((.cse25 (and (or .cse17 .cse9) (or .cse10 .cse24 .cse11)))) (and .cse6 (or .cse0 (and (or .cse24 .cse3 .cse5) (or .cse17 .cse2))) (or .cse0 .cse25) (or .cse8 .cse25)))))) (or (and (or .cse19 (let ((.cse26 (and (or .cse22 .cse1) .cse27))) (and (or .cse0 .cse26) (or .cse26 .cse8)))) (or .cse14 (and (or .cse0 (and .cse28 (or .cse16 .cse1))) .cse15))) .cse23))) .cse36) (or (and (or (let ((.cse46 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse48)))))) (let ((.cse41 (let ((.cse47 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse46))))))))))))) (and (or .cse31 .cse47) (or (not .cse47) .cse29)))) (.cse40 (let ((.cse45 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse46)))))) |c_ULTIMATE.start_main_~var_12~0#1|))) (and (or .cse31 .cse45) (or .cse29 (not .cse45)))))) (let ((.cse42 (let ((.cse44 (and (or .cse1 .cse40) .cse27))) (and (or .cse0 .cse44) (or .cse8 .cse44)))) (.cse43 (and (or .cse41 .cse1) .cse28))) (and (or .cse13 (let ((.cse37 (and (or .cse41 .cse17) .cse18)) (.cse38 (let ((.cse39 (and (or .cse17 .cse40) .cse21))) (and (or .cse8 .cse39) (or .cse0 .cse39))))) (and (or (and (or .cse0 .cse5 .cse37) .cse6 (or .cse10 .cse38)) .cse12) (or (and (or .cse14 (and (or .cse0 .cse37) .cse15)) (or .cse19 .cse38)) .cse23)))) (or (and (or .cse19 .cse42) (or .cse14 (and (or .cse0 .cse43) .cse15))) .cse23) (or (and (or .cse10 .cse42) (or .cse0 .cse43 .cse5) .cse6) .cse12))))) .cse49) (or (let ((.cse56 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse59))))))))))))) (let ((.cse51 (let ((.cse57 (and (or .cse1 (let ((.cse58 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse56))))))))) (and (or .cse29 (not .cse58)) (or .cse31 .cse58)))) .cse27))) (and (or .cse8 .cse57) (or .cse0 .cse57)))) (.cse50 (and (or (let ((.cse55 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse56)))))))))) |c_ULTIMATE.start_main_~var_12~0#1|))) (and (or (not .cse55) .cse29) (or .cse31 .cse55))) .cse1) .cse28))) (and (or (and (or .cse14 (and .cse15 (or .cse0 .cse50))) (or .cse19 .cse51)) .cse23) (or .cse13 (and .cse52 (or (and (or .cse19 .cse53) (or .cse14 (and .cse15 (or .cse0 .cse54)))) .cse23))) (or (and .cse6 (or .cse10 .cse51) (or .cse0 .cse5 .cse50)) .cse12)))) .cse60)) .cse61)))) .cse62) (or (not .cse62) (let ((.cse63 (and (or (let ((.cse66 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse59))))))))) (let ((.cse64 (let ((.cse67 (and .cse27 (or .cse1 (let ((.cse68 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse66))))))))) (and (or .cse31 .cse68) (or .cse29 (not .cse68)))))))) (and (or .cse8 .cse67) (or .cse0 .cse67))))) (and (or (and .cse6 (or .cse10 .cse64) (or .cse0 (and (or (let ((.cse65 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse66)))))))))) |c_ULTIMATE.start_main_~var_12~0#1|))) (and (or (not .cse65) .cse29) (or .cse31 .cse65))) .cse1) .cse28) .cse5)) .cse12) (or .cse13 (and .cse52 (or .cse23 .cse53))) (or .cse23 .cse64)))) .cse60) (or .cse49 (let ((.cse75 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse78)))))) (let ((.cse72 (let ((.cse77 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse75)))))) |c_ULTIMATE.start_main_~var_12~0#1|))) (and (or .cse31 .cse77) (or (not .cse77) .cse29))))) (let ((.cse73 (let ((.cse76 (and .cse27 (or .cse72 .cse1)))) (and (or .cse76 .cse8) (or .cse0 .cse76)))) (.cse70 (let ((.cse74 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse75))))))) .cse30)))))) (and (or .cse29 (not .cse74)) (or .cse31 .cse74))))) (and (or .cse13 (let ((.cse69 (let ((.cse71 (and (or .cse17 .cse72) .cse21))) (and (or .cse0 .cse71) (or .cse71 .cse8))))) (and (or .cse12 (and .cse6 (or .cse10 .cse69) (or .cse0 (and (or .cse17 .cse70) .cse18) .cse5))) (or .cse23 .cse69)))) (or .cse73 .cse23) (or (and (or .cse10 .cse73) .cse6 (or .cse0 (and (or .cse70 .cse1) .cse28) .cse5)) .cse12))))))))) (and (or .cse63 .cse36) (or .cse61 .cse63))))))))))))) is different from false [2025-02-08 00:10:54,772 WARN L286 SmtUtils]: Spent 14.36s on a formula simplification that was a NOOP. DAG size: 545 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)