./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p10.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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_p10.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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '852b31bb77918f9ff789dd545f15c8575df0839f0cc2131d6ca7329f9665db0f'] 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_p10.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 852b31bb77918f9ff789dd545f15c8575df0839f0cc2131d6ca7329f9665db0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:46:16,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:46:16,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 03:46:16,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:46:16,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:46:16,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:46:16,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:46:16,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:46:16,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:46:16,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:46:16,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:46:16,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:46:16,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:46:16,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:46:16,317 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:46:16,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:46:16,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:46:16,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:46:16,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:46:16,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:46:16,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:46:16,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:46:16,318 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:46:16,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:46:16,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:46:16,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:46:16,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:46:16,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:46:16,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:46:16,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:16,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:46:16,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:46:16,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:46:16,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:46:16,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:46:16,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:46:16,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:46:16,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:46:16,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:46:16,321 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 -> 852b31bb77918f9ff789dd545f15c8575df0839f0cc2131d6ca7329f9665db0f [2024-11-07 03:46:16,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:46:16,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:46:16,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:46:16,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:46:16,604 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:46:16,605 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_p10.c [2024-11-07 03:46:17,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:46:18,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:46:18,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p10.c [2024-11-07 03:46:18,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/427f5ea22/bdae222935f841a1acc26e8501dca12d/FLAGd5748b3dc [2024-11-07 03:46:18,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/427f5ea22/bdae222935f841a1acc26e8501dca12d [2024-11-07 03:46:18,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:46:18,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:46:18,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:18,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:46:18,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:46:18,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a346647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18, skipping insertion in model container [2024-11-07 03:46:18,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:46:18,286 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_p10.c[1266,1279] [2024-11-07 03:46:18,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:18,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:46:18,403 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_p10.c[1266,1279] [2024-11-07 03:46:18,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:18,489 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:46:18,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18 WrapperNode [2024-11-07 03:46:18,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:18,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:18,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:46:18,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:46:18,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,595 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 747 [2024-11-07 03:46:18,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:18,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:46:18,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:46:18,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:46:18,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,668 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]. [2024-11-07 03:46:18,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:46:18,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:46:18,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:46:18,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:46:18,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (1/1) ... [2024-11-07 03:46:18,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:18,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:46:18,776 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) [2024-11-07 03:46:18,817 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 [2024-11-07 03:46:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:46:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:46:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:46:18,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:46:19,015 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:46:19,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:46:19,879 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2024-11-07 03:46:19,879 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:46:19,893 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:46:19,894 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:46:19,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:19 BoogieIcfgContainer [2024-11-07 03:46:19,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:46:19,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:46:19,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:46:19,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:46:19,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:46:18" (1/3) ... [2024-11-07 03:46:19,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1d3f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:19, skipping insertion in model container [2024-11-07 03:46:19,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:18" (2/3) ... [2024-11-07 03:46:19,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1d3f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:19, skipping insertion in model container [2024-11-07 03:46:19,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:19" (3/3) ... [2024-11-07 03:46:19,907 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p10.c [2024-11-07 03:46:19,920 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:46:19,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:46:19,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:46:19,982 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;@3cec8745, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:46:19,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:46:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 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) [2024-11-07 03:46:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 03:46:19,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:19,991 INFO L215 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] [2024-11-07 03:46:19,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:19,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 387884158, now seen corresponding path program 1 times [2024-11-07 03:46:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:20,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715236586] [2024-11-07 03:46:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:20,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:20,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715236586] [2024-11-07 03:46:20,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715236586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:20,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:20,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:46:20,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663439098] [2024-11-07 03:46:20,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:20,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:46:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:20,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:46:20,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:20,670 INFO L87 Difference]: Start difference. First operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 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.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) [2024-11-07 03:46:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:20,723 INFO L93 Difference]: Finished difference Result 229 states and 339 transitions. [2024-11-07 03:46:20,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:20,725 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 [2024-11-07 03:46:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:20,732 INFO L225 Difference]: With dead ends: 229 [2024-11-07 03:46:20,733 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 03:46:20,736 INFO L431 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 [2024-11-07 03:46:20,739 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:20,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 03:46:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-07 03:46:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 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) [2024-11-07 03:46:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-11-07 03:46:20,773 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 41 [2024-11-07 03:46:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:20,773 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-11-07 03:46:20,773 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) [2024-11-07 03:46:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-11-07 03:46:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 03:46:20,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:20,775 INFO L215 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] [2024-11-07 03:46:20,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:46:20,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:20,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:20,776 INFO L85 PathProgramCache]: Analyzing trace with hash -858797603, now seen corresponding path program 1 times [2024-11-07 03:46:20,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:20,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924566251] [2024-11-07 03:46:20,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:20,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:21,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:21,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924566251] [2024-11-07 03:46:21,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924566251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:21,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:21,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:46:21,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485110486] [2024-11-07 03:46:21,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:21,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:46:21,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:21,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:46:21,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:21,006 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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) [2024-11-07 03:46:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:21,057 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2024-11-07 03:46:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:21,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 [2024-11-07 03:46:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:21,060 INFO L225 Difference]: With dead ends: 230 [2024-11-07 03:46:21,060 INFO L226 Difference]: Without dead ends: 143 [2024-11-07 03:46:21,061 INFO L431 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 [2024-11-07 03:46:21,061 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:21,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-07 03:46:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-07 03:46:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.471830985915493) internal successors, (209), 142 states have internal predecessors, (209), 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) [2024-11-07 03:46:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2024-11-07 03:46:21,072 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 42 [2024-11-07 03:46:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:21,072 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2024-11-07 03:46:21,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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) [2024-11-07 03:46:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2024-11-07 03:46:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 03:46:21,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:21,073 INFO L215 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] [2024-11-07 03:46:21,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:46:21,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:21,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:21,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1950887625, now seen corresponding path program 1 times [2024-11-07 03:46:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:21,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376082121] [2024-11-07 03:46:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:21,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:21,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:21,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376082121] [2024-11-07 03:46:21,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376082121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:21,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:21,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:46:21,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434253291] [2024-11-07 03:46:21,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:21,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:46:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:46:21,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:46:21,472 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) 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) [2024-11-07 03:46:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:21,605 INFO L93 Difference]: Finished difference Result 236 states and 344 transitions. [2024-11-07 03:46:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:46:21,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) 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 [2024-11-07 03:46:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:21,608 INFO L225 Difference]: With dead ends: 236 [2024-11-07 03:46:21,609 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 03:46:21,610 INFO L431 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 [2024-11-07 03:46:21,610 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 178 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:21,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 732 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:46:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 03:46:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-07 03:46:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4620689655172414) internal successors, (212), 145 states have internal predecessors, (212), 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) [2024-11-07 03:46:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-07 03:46:21,618 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 43 [2024-11-07 03:46:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:21,618 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-07 03:46:21,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) 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) [2024-11-07 03:46:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-07 03:46:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 03:46:21,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:21,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:46:21,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:46:21,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:21,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:21,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1216571104, now seen corresponding path program 1 times [2024-11-07 03:46:21,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:21,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115995189] [2024-11-07 03:46:21,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:21,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:46:21,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:46:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:46:21,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:46:21,768 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:46:21,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:46:21,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:46:21,773 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 03:46:21,828 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:46:21,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:46:21 BoogieIcfgContainer [2024-11-07 03:46:21,833 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:46:21,834 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:46:21,834 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:46:21,834 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:46:21,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:19" (3/4) ... [2024-11-07 03:46:21,837 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:46:21,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:46:21,839 INFO L158 Benchmark]: Toolchain (without parser) took 3694.41ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 91.1MB in the beginning and 68.9MB in the end (delta: 22.2MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2024-11-07 03:46:21,839 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:21,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.26ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 69.5MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 03:46:21,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.49ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 55.8MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:46:21,841 INFO L158 Benchmark]: Boogie Preprocessor took 148.25ms. Allocated memory is still 117.4MB. Free memory was 55.8MB in the beginning and 47.1MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:46:21,841 INFO L158 Benchmark]: RCFGBuilder took 1149.85ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 47.1MB in the beginning and 108.4MB in the end (delta: -61.3MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-11-07 03:46:21,842 INFO L158 Benchmark]: TraceAbstraction took 1936.36ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 68.9MB in the end (delta: 39.0MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-11-07 03:46:21,842 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 167.8MB. Free memory was 68.9MB in the beginning and 68.9MB in the end (delta: 41.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:21,844 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.35ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.26ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 69.5MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.49ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 55.8MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.25ms. Allocated memory is still 117.4MB. Free memory was 55.8MB in the beginning and 47.1MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1149.85ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 47.1MB in the beginning and 108.4MB in the end (delta: -61.3MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1936.36ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 68.9MB in the end (delta: 39.0MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 167.8MB. Free memory was 68.9MB in the beginning and 68.9MB in the end (delta: 41.3kB). 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 170. 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_123 = 104; [L46] const SORT_10 var_140 = 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_1 input_34; [L55] SORT_31 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_80; [L66] SORT_1 input_92; [L67] SORT_1 input_99; [L68] SORT_1 input_105; [L69] SORT_1 input_111; [L70] SORT_1 input_117; [L71] SORT_1 input_118; [L72] SORT_1 input_119; [L73] SORT_67 input_138; [L74] SORT_1 input_147; [L75] SORT_1 input_148; [L76] SORT_1 input_149; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L78] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L79] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L80] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L81] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L82] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L83] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L84] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L85] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L86] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L87] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L88] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_ushort() & mask_SORT_67 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L89] SORT_67 state_69 = __VERIFIER_nondet_ushort() & mask_SORT_67; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L90] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_1 init_9_arg_1 = var_7; [L93] state_8 = init_9_arg_1 [L94] SORT_1 init_15_arg_1 = var_7; [L95] state_14 = init_15_arg_1 [L96] SORT_1 init_26_arg_1 = var_7; [L97] state_25 = init_26_arg_1 [L98] SORT_1 init_28_arg_1 = var_7; [L99] state_27 = init_28_arg_1 [L100] SORT_1 init_41_arg_1 = var_7; [L101] state_40 = init_41_arg_1 [L102] SORT_1 init_43_arg_1 = var_7; [L103] state_42 = init_43_arg_1 [L104] SORT_1 init_51_arg_1 = var_21; [L105] state_50 = init_51_arg_1 [L106] SORT_1 init_58_arg_1 = var_7; [L107] state_57 = init_58_arg_1 [L108] SORT_1 init_60_arg_1 = var_7; [L109] state_59 = init_60_arg_1 [L110] SORT_1 init_62_arg_1 = var_7; [L111] state_61 = init_62_arg_1 [L112] SORT_1 init_66_arg_1 = var_7; [L113] state_65 = init_66_arg_1 [L114] SORT_67 init_70_arg_1 = var_68; [L115] state_69 = init_70_arg_1 [L116] SORT_1 init_72_arg_1 = var_7; [L117] 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_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L120] input_2 = __VERIFIER_nondet_uchar() [L121] input_4 = __VERIFIER_nondet_uchar() [L122] input_5 = __VERIFIER_nondet_uchar() [L123] input_6 = __VERIFIER_nondet_uchar() [L124] input_29 = __VERIFIER_nondet_uchar() [L125] input_32 = __VERIFIER_nondet_uchar() [L126] input_34 = __VERIFIER_nondet_uchar() [L127] input_36 = __VERIFIER_nondet_uchar() [L128] input_38 = __VERIFIER_nondet_uchar() [L129] input_44 = __VERIFIER_nondet_uchar() [L130] input_46 = __VERIFIER_nondet_uchar() [L131] input_48 = __VERIFIER_nondet_uchar() [L132] input_52 = __VERIFIER_nondet_uchar() [L133] input_55 = __VERIFIER_nondet_uchar() [L134] input_63 = __VERIFIER_nondet_uchar() [L135] input_73 = __VERIFIER_nondet_uchar() [L136] input_79 = __VERIFIER_nondet_uchar() [L137] input_80 = __VERIFIER_nondet_uchar() [L138] input_92 = __VERIFIER_nondet_uchar() [L139] input_99 = __VERIFIER_nondet_uchar() [L140] input_105 = __VERIFIER_nondet_uchar() [L141] input_111 = __VERIFIER_nondet_uchar() [L142] input_117 = __VERIFIER_nondet_uchar() [L143] input_118 = __VERIFIER_nondet_uchar() [L144] input_119 = __VERIFIER_nondet_uchar() [L145] input_138 = __VERIFIER_nondet_ushort() [L146] input_147 = __VERIFIER_nondet_uchar() [L147] input_148 = __VERIFIER_nondet_uchar() [L148] input_149 = __VERIFIER_nondet_uchar() [L151] 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_11_arg_0=0, var_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L152] 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_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L152] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L153] SORT_10 var_11 = var_11_arg_0; [L154] SORT_10 var_13_arg_0 = var_11; [L155] SORT_10 var_13_arg_1 = var_12; [L156] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L157] 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_123=104, var_12=0, var_13=1, var_140=1, var_16_arg_0=0, var_21=1, var_68=0, var_7=0] [L158] 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_123=104, var_12=0, var_13=1, var_140=1, var_21=1, var_68=0, var_7=0] [L158] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L159] SORT_10 var_16 = var_16_arg_0; [L160] SORT_10 var_17_arg_0 = var_16; [L161] SORT_10 var_17_arg_1 = var_12; [L162] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L163] SORT_1 var_18_arg_0 = var_13; [L164] 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_123=104, var_12=0, var_140=1, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_68=0, var_7=0] [L165] 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_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L165] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L166] SORT_1 var_22_arg_0 = var_18; [L167] SORT_1 var_22 = ~var_22_arg_0; [L168] SORT_1 var_23_arg_0 = var_21; [L169] 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_123=104, var_12=0, var_140=1, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_68=0, var_7=0] [L170] 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_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L170] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L171] 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_123=104, var_12=0, var_140=1, var_21=1, var_68=0, var_7=0] [L171] var_23 = var_23 & mask_SORT_1 [L172] SORT_1 bad_24_arg_0 = var_23; [L173] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 1934 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1343 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 591 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 03:46:21,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_p10.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 852b31bb77918f9ff789dd545f15c8575df0839f0cc2131d6ca7329f9665db0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:46:23,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:46:24,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 03:46:24,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:46:24,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:46:24,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:46:24,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:46:24,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:46:24,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:46:24,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:46:24,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:46:24,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:46:24,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:46:24,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:46:24,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:46:24,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:46:24,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:46:24,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:46:24,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:46:24,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:46:24,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:46:24,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:46:24,118 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:46:24,118 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:46:24,119 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:46:24,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:46:24,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:46:24,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:46:24,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:46:24,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:46:24,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:46:24,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:24,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:46:24,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:46:24,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:46:24,121 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:46:24,121 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:46:24,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:46:24,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:46:24,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:46:24,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:46:24,122 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 -> 852b31bb77918f9ff789dd545f15c8575df0839f0cc2131d6ca7329f9665db0f [2024-11-07 03:46:24,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:46:24,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:46:24,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:46:24,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:46:24,400 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:46:24,401 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_p10.c [2024-11-07 03:46:25,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:46:25,920 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:46:25,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p10.c [2024-11-07 03:46:25,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c901e4f6b/535e5f318de94c5dba871148495117fa/FLAGdd4835135 [2024-11-07 03:46:26,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c901e4f6b/535e5f318de94c5dba871148495117fa [2024-11-07 03:46:26,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:46:26,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:46:26,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:26,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:46:26,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:46:26,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f3f1526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26, skipping insertion in model container [2024-11-07 03:46:26,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:46:26,412 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_p10.c[1266,1279] [2024-11-07 03:46:26,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:26,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:46:26,537 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_p10.c[1266,1279] [2024-11-07 03:46:26,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:26,627 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:46:26,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26 WrapperNode [2024-11-07 03:46:26,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:26,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:26,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:46:26,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:46:26,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,675 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 483 [2024-11-07 03:46:26,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:26,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:46:26,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:46:26,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:46:26,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,707 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]. [2024-11-07 03:46:26,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:46:26,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:46:26,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:46:26,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:46:26,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (1/1) ... [2024-11-07 03:46:26,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:26,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:46:26,776 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) [2024-11-07 03:46:26,782 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 [2024-11-07 03:46:26,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:46:26,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:46:26,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:46:26,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:46:26,957 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:46:26,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:46:27,313 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-07 03:46:27,313 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:46:27,320 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:46:27,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:46:27,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:27 BoogieIcfgContainer [2024-11-07 03:46:27,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:46:27,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:46:27,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:46:27,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:46:27,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:46:26" (1/3) ... [2024-11-07 03:46:27,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5033826d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:27, skipping insertion in model container [2024-11-07 03:46:27,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:26" (2/3) ... [2024-11-07 03:46:27,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5033826d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:27, skipping insertion in model container [2024-11-07 03:46:27,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:27" (3/3) ... [2024-11-07 03:46:27,330 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p10.c [2024-11-07 03:46:27,342 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:46:27,343 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:46:27,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:46:27,405 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;@59f9e8c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:46:27,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:46:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:46:27,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 03:46:27,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:27,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 03:46:27,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:27,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 03:46:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:46:27,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869429702] [2024-11-07 03:46:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:27,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:46:27,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:46:27,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:46:27,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 03:46:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:27,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 03:46:27,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:46:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:27,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:46:27,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:46:27,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869429702] [2024-11-07 03:46:27,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869429702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:27,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:27,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:46:27,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857798607] [2024-11-07 03:46:27,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:27,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:46:27,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:46:27,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:46:27,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:27,817 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2024-11-07 03:46:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:27,873 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-07 03:46:27,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:27,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-07 03:46:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:27,882 INFO L225 Difference]: With dead ends: 18 [2024-11-07 03:46:27,882 INFO L226 Difference]: Without dead ends: 10 [2024-11-07 03:46:27,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:46:27,887 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 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 [2024-11-07 03:46:27,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-07 03:46:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-07 03:46:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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) [2024-11-07 03:46:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 03:46:27,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 03:46:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:27,911 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 03:46:27,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2024-11-07 03:46:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 03:46:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 03:46:27,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:27,912 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 03:46:27,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 03:46:28,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:46:28,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:28,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 03:46:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:46:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987919902] [2024-11-07 03:46:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:28,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:46:28,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:46:28,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:46:28,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 03:46:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:28,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 03:46:28,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:46:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:46:31,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:47:25,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse23 (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_10|) ((_ 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_1~0#1_10|)))))))))))) (_ bv0 8)))) (.cse41 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse83 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse83)))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse83)))))))))))) (.cse16 (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_10|) ((_ 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_1~0#1_10|))))))))))))))) (.cse42 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse82 ((_ 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 .cse17 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse82))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse82))))))))))) (let ((.cse77 ((_ 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_7~0#1|)))))))) (.cse74 (or .cse16 .cse42)) (.cse75 (or .cse23 .cse41))) (let ((.cse6 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_42~0#1|)) (.cse24 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse81 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse81))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse81))))) (_ bv0 8))))))) (.cse50 (and .cse74 .cse75)) (.cse12 (let ((.cse80 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) .cse77)))))))) (and (or .cse80 .cse23) (or .cse16 (not .cse80))))) (.cse43 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_57~0#1|)) (.cse9 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|)))))))))))) (.cse1 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse79)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse79))))))))))) (.cse2 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse78 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse78))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse78))))))))))) (.cse7 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))))))) (.cse35 (let ((.cse76 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 .cse17)))))) (and (or .cse76 .cse23) (or .cse16 (not .cse76)))))) (let ((.cse5 (or .cse43 (let ((.cse73 (and .cse74 (or .cse7 .cse35) .cse75))) (and (or .cse1 .cse73) (or .cse9 (and (or .cse1 .cse35) (or .cse35 .cse2))) (or .cse2 .cse73))))) (.cse3 (and (or (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse71 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse71)))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse71))))))))))))) .cse23) (or .cse12 .cse7) (or .cse16 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse72 ((_ 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 .cse17 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse72))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse72)))))))))))) (.cse0 (and (or .cse23 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse69 ((_ 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 .cse17 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse69)))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse69))))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse70 ((_ 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 .cse17 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse70))))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse70))))))))))))) (.cse38 (or .cse24 .cse50)) (.cse10 (let ((.cse68 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|))))))))))) (and (or .cse23 .cse68) (or .cse16 (not .cse68))))) (.cse4 (not .cse43)) (.cse11 (not .cse6))) (and (or (and (or (and (or .cse0 .cse1) (or .cse0 .cse2) (or .cse3 .cse2) (or .cse3 .cse1)) .cse4) .cse5) .cse6) (or (and (or (let ((.cse8 (and (or .cse10 .cse1) (or .cse10 .cse2)))) (and (or .cse7 .cse8) (or .cse9 .cse8))) .cse4) .cse5) .cse11) (or .cse6 (let ((.cse25 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse45)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse45))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|)))))))))))) .cse45))))))))))) (.cse20 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse44)))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse44)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|)))))))))))) .cse44))))))))))) (.cse14 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))))) (.cse13 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))))))) (.cse15 (forall ((|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) (_ bv0 8))))) (and (or .cse4 (and (or (and (or .cse12 .cse13) (or .cse12 .cse14)) .cse7 .cse15) (or .cse16 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|)))))))))) (.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse18)))))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse19))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse18))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse19))) .cse18))))))))))) (or .cse12 .cse20) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse21)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse21))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse22))) .cse21))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse22))))))) .cse23) (or .cse3 .cse24) (or .cse12 .cse25) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse26)))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse26)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse27))) .cse26))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse27))))))) .cse23) (or .cse16 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|)))))))))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse28)))))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse29))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse28)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse29))) .cse28))))))))))) (or .cse0 .cse24) (or .cse15 (and (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse31)))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse30))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse30)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse31))))))))))) .cse23) (or .cse16 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|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|))))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse33)))))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse32))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse32))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse33)))))))))))) (or .cse12 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|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 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse34))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse34))))))))))))))) (or (and (or .cse25 .cse35) (or .cse16 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse37)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse36))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse36))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse37)))))))))))) .cse38 (or .cse35 .cse20) (or .cse23 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse40 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse39 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse40)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse39))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse39)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse40)))))))))))) (or (and (or (and (or .cse14 .cse41) (or .cse13 .cse41)) .cse23) (or .cse16 (and (or .cse42 .cse14) (or .cse42 .cse13)))) .cse15)) .cse43)))) (or (let ((.cse51 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse67 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse67)))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse67)))))))))) (.cse62 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse66)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse66))))))))))) (.cse57 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse65)))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse65)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))))))))))))))) (.cse56 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse64)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse64))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|)))))))))))))))))))) (and (or .cse43 (and (or .cse16 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse47 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse46 ((_ zero_extend 24) ((_ extract 7 0) .cse47)))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) .cse46))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ 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 .cse46))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse47)))))))))))) (or .cse23 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse48)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse48))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) .cse49)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse49)))))))))))))) (or .cse50 .cse51) (or .cse23 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))) (.cse53 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse52)))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse52)))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) .cse53)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse53)))))))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse54 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))) (.cse55 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse54)))))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) .cse55))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse54)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse54 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse55)))))))))))))) (or .cse35 .cse56) (or .cse35 .cse57) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse58 ((_ zero_extend 24) ((_ extract 7 0) .cse59)))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ 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 .cse58))))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) .cse58)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse59))))))))))) .cse23) (or .cse16 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse60 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))) (.cse61 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) .cse60)))))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) .cse61))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse60))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse60 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse61)))))))))))))) .cse38 (or .cse62 .cse50))) (or (and (or .cse10 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse63 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ 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) ((_ extract 7 0) .cse63))))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse63))))))))))) (or .cse7 (and (or .cse10 .cse51) (or .cse62 .cse10) (or .cse10 .cse24))) (or .cse10 .cse57) (or .cse10 .cse56)) .cse4))) .cse11))))))) is different from false