./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.dyn_partition.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26998269 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.dyn_partition.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:24:50,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:24:50,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-14 14:24:50,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:24:50,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:24:50,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:24:50,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:24:50,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:24:50,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:24:50,582 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:24:50,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:24:50,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:24:50,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:24:50,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:24:50,585 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:24:50,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:24:50,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:24:50,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:24:50,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:24:50,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:24:50,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:24:50,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:24:50,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:24:50,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:24:50,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:24:50,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:24:50,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:24:50,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:24:50,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:24:50,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:24:50,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:24:50,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:24:50,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:24:50,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:24:50,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:24:50,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:24:50,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:24:50,593 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:24:50,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:24:50,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:24:50,596 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:24:50,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:24:50,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:24:50,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:24:50,954 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:24:50,954 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:24:50,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-08-14 14:24:52,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:24:52,562 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:24:52,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-08-14 14:24:52,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30662361/dce6b5f2d7c4475fb08a6f02aa5791f3/FLAG60cf2051b [2024-08-14 14:24:52,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30662361/dce6b5f2d7c4475fb08a6f02aa5791f3 [2024-08-14 14:24:52,913 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:24:52,914 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:24:52,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.dyn_partition.yml/witness.yml [2024-08-14 14:24:53,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:24:53,036 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:24:53,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:24:53,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:24:53,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:24:53,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:24:52" (1/2) ... [2024-08-14 14:24:53,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c7f3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:53, skipping insertion in model container [2024-08-14 14:24:53,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:24:52" (1/2) ... [2024-08-14 14:24:53,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@19469cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:53, skipping insertion in model container [2024-08-14 14:24:53,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:53" (2/2) ... [2024-08-14 14:24:53,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c7f3ee and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53, skipping insertion in model container [2024-08-14 14:24:53,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:53" (2/2) ... [2024-08-14 14:24:53,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:24:53,233 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-08-14 14:24:53,287 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:24:53,303 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:24:53,313 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-08-14 14:24:53,336 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:24:53,353 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:24:53,353 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53 WrapperNode [2024-08-14 14:24:53,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:24:53,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:24:53,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:24:53,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:24:53,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53" (1/1) ... [2024-08-14 14:24:53,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53" (1/1) ... [2024-08-14 14:24:53,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53" (1/1) ... [2024-08-14 14:24:53,414 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-08-14 14:24:53,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53" (1/1) ... [2024-08-14 14:24:53,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53" (1/1) ... [2024-08-14 14:24:53,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53" (1/1) ... [2024-08-14 14:24:53,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53" (1/1) ... [2024-08-14 14:24:53,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53" (1/1) ... [2024-08-14 14:24:53,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:24:53,445 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:24:53,445 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:24:53,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:24:53,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53" (1/1) ... [2024-08-14 14:24:53,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:24:53,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:53,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:24:53,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:24:53,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:24:53,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:24:53,547 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:24:53,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:24:53,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:24:53,548 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:24:53,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:24:53,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:24:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:24:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:24:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:24:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:24:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:24:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:24:53,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:24:53,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:24:53,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:24:53,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:24:53,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:24:53,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:24:53,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:24:53,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:24:53,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:24:53,672 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:24:53,679 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:24:54,172 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-08-14 14:24:54,174 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:24:54,185 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:24:54,185 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:24:54,186 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:24:54 BoogieIcfgContainer [2024-08-14 14:24:54,186 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:24:54,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:24:54,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:24:54,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:24:54,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:24:52" (1/4) ... [2024-08-14 14:24:54,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e64024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:24:54, skipping insertion in model container [2024-08-14 14:24:54,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:53" (2/4) ... [2024-08-14 14:24:54,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e64024 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:24:54, skipping insertion in model container [2024-08-14 14:24:54,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:53" (3/4) ... [2024-08-14 14:24:54,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e64024 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:24:54, skipping insertion in model container [2024-08-14 14:24:54,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:24:54" (4/4) ... [2024-08-14 14:24:54,197 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-08-14 14:24:54,197 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:24:54,218 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:24:54,218 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:24:54,246 INFO L92 WitnessUtils]: Constructing product of automaton with 54 states and violation witness of the following lengths: [48] [2024-08-14 14:24:54,250 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 54 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:24:54,464 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 1106 states to 926 states. [2024-08-14 14:24:54,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:24:54,495 INFO L357 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, mHoare=false, 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;@3f162f7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:24:54,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:24:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states. [2024-08-14 14:24:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-08-14 14:24:54,530 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:54,531 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:54,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:54,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1449129408, now seen corresponding path program 1 times [2024-08-14 14:24:54,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:54,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170397334] [2024-08-14 14:24:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-08-14 14:24:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:24:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-14 14:24:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-14 14:24:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-08-14 14:24:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-08-14 14:24:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-14 14:24:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-08-14 14:24:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-08-14 14:24:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-08-14 14:24:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-08-14 14:24:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-14 14:24:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-08-14 14:24:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-08-14 14:24:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2024-08-14 14:24:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 2265 trivial. 0 not checked. [2024-08-14 14:24:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170397334] [2024-08-14 14:24:57,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170397334] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:57,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:24:57,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:24:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775249063] [2024-08-14 14:24:57,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:57,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:24:57,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:57,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:24:57,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:24:57,245 INFO L87 Difference]: Start difference. First operand 926 states. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:24:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:57,335 INFO L93 Difference]: Finished difference Result 845 states and 1243 transitions. [2024-08-14 14:24:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:24:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 338 [2024-08-14 14:24:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:57,343 INFO L225 Difference]: With dead ends: 845 [2024-08-14 14:24:57,343 INFO L226 Difference]: Without dead ends: 830 [2024-08-14 14:24:57,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:24:57,348 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 28 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:57,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 326 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:24:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-08-14 14:24:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 452. [2024-08-14 14:24:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 416 states have (on average 1.5360576923076923) internal successors, (639), 417 states have internal predecessors, (639), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:24:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 674 transitions. [2024-08-14 14:24:57,445 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 674 transitions. Word has length 338 [2024-08-14 14:24:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:57,450 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 674 transitions. [2024-08-14 14:24:57,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:24:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 674 transitions. [2024-08-14 14:24:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-08-14 14:24:57,458 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:57,459 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:57,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:24:57,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:57,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash 355720381, now seen corresponding path program 1 times [2024-08-14 14:24:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:57,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608508704] [2024-08-14 14:24:57,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-08-14 14:24:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:24:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-14 14:24:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-14 14:24:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-08-14 14:24:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-08-14 14:24:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-14 14:24:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-08-14 14:24:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-08-14 14:24:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-08-14 14:24:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-08-14 14:24:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-14 14:24:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-08-14 14:24:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-08-14 14:24:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2024-08-14 14:24:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2024-08-14 14:24:58,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:58,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608508704] [2024-08-14 14:24:58,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608508704] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:58,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:24:58,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:24:58,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258651745] [2024-08-14 14:24:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:58,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:24:58,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:24:58,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:24:58,578 INFO L87 Difference]: Start difference. First operand 452 states and 674 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:24:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:58,608 INFO L93 Difference]: Finished difference Result 484 states and 706 transitions. [2024-08-14 14:24:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:24:58,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 339 [2024-08-14 14:24:58,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:58,614 INFO L225 Difference]: With dead ends: 484 [2024-08-14 14:24:58,615 INFO L226 Difference]: Without dead ends: 484 [2024-08-14 14:24:58,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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-08-14 14:24:58,616 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:58,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:24:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-08-14 14:24:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 482. [2024-08-14 14:24:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 446 states have (on average 1.5) internal successors, (669), 447 states have internal predecessors, (669), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:24:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 704 transitions. [2024-08-14 14:24:58,657 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 704 transitions. Word has length 339 [2024-08-14 14:24:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:58,660 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 704 transitions. [2024-08-14 14:24:58,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:24:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 704 transitions. [2024-08-14 14:24:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-08-14 14:24:58,665 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:58,666 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:58,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:24:58,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:58,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:58,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1765603421, now seen corresponding path program 1 times [2024-08-14 14:24:58,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:58,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135952155] [2024-08-14 14:24:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:58,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-08-14 14:25:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:25:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-14 14:25:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-14 14:25:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-08-14 14:25:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-08-14 14:25:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-14 14:25:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-08-14 14:25:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-08-14 14:25:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-08-14 14:25:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-08-14 14:25:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-14 14:25:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-08-14 14:25:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-08-14 14:25:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2024-08-14 14:25:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 300 proven. 1 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2024-08-14 14:25:00,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:00,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135952155] [2024-08-14 14:25:00,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135952155] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:00,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968414087] [2024-08-14 14:25:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:00,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:00,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:00,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:00,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-14 14:25:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:01,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 1984 conjuncts, 70 conjunts are in the unsatisfiable core [2024-08-14 14:25:01,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2295 trivial. 0 not checked. [2024-08-14 14:25:01,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:25:01,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968414087] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:25:01,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:25:01,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2024-08-14 14:25:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387542169] [2024-08-14 14:25:01,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:25:01,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:25:01,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:01,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:25:01,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:25:01,643 INFO L87 Difference]: Start difference. First operand 482 states and 704 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:25:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:01,758 INFO L93 Difference]: Finished difference Result 480 states and 700 transitions. [2024-08-14 14:25:01,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:25:01,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 340 [2024-08-14 14:25:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:01,761 INFO L225 Difference]: With dead ends: 480 [2024-08-14 14:25:01,761 INFO L226 Difference]: Without dead ends: 480 [2024-08-14 14:25:01,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:25:01,765 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:01,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 176 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:25:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-08-14 14:25:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2024-08-14 14:25:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 444 states have (on average 1.4977477477477477) internal successors, (665), 445 states have internal predecessors, (665), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:25:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 700 transitions. [2024-08-14 14:25:01,781 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 700 transitions. Word has length 340 [2024-08-14 14:25:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:01,781 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 700 transitions. [2024-08-14 14:25:01,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:25:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 700 transitions. [2024-08-14 14:25:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-08-14 14:25:01,786 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:01,786 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:01,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-08-14 14:25:01,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:01,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:01,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1771785614, now seen corresponding path program 1 times [2024-08-14 14:25:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:01,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947585376] [2024-08-14 14:25:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-14 14:25:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:25:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-08-14 14:25:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-08-14 14:25:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-08-14 14:25:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-08-14 14:25:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-08-14 14:25:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-08-14 14:25:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-08-14 14:25:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-08-14 14:25:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-08-14 14:25:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-08-14 14:25:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-08-14 14:25:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-08-14 14:25:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-08-14 14:25:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2326 backedges. 507 proven. 2 refuted. 0 times theorem prover too weak. 1817 trivial. 0 not checked. [2024-08-14 14:25:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:03,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947585376] [2024-08-14 14:25:03,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947585376] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896691304] [2024-08-14 14:25:03,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:03,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:03,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:03,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:03,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-14 14:25:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:04,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 69 conjunts are in the unsatisfiable core [2024-08-14 14:25:04,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2326 backedges. 487 proven. 78 refuted. 0 times theorem prover too weak. 1761 trivial. 0 not checked. [2024-08-14 14:25:05,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2326 backedges. 366 proven. 16 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2024-08-14 14:25:07,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896691304] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:07,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:07,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 9] total 22 [2024-08-14 14:25:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630645449] [2024-08-14 14:25:07,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:07,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-14 14:25:07,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:07,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-14 14:25:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2024-08-14 14:25:07,275 INFO L87 Difference]: Start difference. First operand 480 states and 700 transitions. Second operand has 22 states, 22 states have (on average 7.0) internal successors, (154), 22 states have internal predecessors, (154), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-08-14 14:25:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:07,625 INFO L93 Difference]: Finished difference Result 807 states and 1160 transitions. [2024-08-14 14:25:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 14:25:07,626 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.0) internal successors, (154), 22 states have internal predecessors, (154), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 341 [2024-08-14 14:25:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:07,629 INFO L225 Difference]: With dead ends: 807 [2024-08-14 14:25:07,630 INFO L226 Difference]: Without dead ends: 807 [2024-08-14 14:25:07,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2024-08-14 14:25:07,633 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 146 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:07,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 452 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:25:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-08-14 14:25:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 452. [2024-08-14 14:25:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 416 states have (on average 1.4591346153846154) internal successors, (607), 417 states have internal predecessors, (607), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:25:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 642 transitions. [2024-08-14 14:25:07,654 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 642 transitions. Word has length 341 [2024-08-14 14:25:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:07,655 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 642 transitions. [2024-08-14 14:25:07,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.0) internal successors, (154), 22 states have internal predecessors, (154), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-08-14 14:25:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 642 transitions. [2024-08-14 14:25:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-08-14 14:25:07,659 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:07,659 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:07,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-08-14 14:25:07,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-08-14 14:25:07,864 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:07,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash -677566355, now seen corresponding path program 1 times [2024-08-14 14:25:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:07,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400101195] [2024-08-14 14:25:07,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-14 14:25:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-08-14 14:25:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-08-14 14:25:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-08-14 14:25:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-08-14 14:25:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-08-14 14:25:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-08-14 14:25:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-08-14 14:25:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-08-14 14:25:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-08-14 14:25:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-08-14 14:25:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-08-14 14:25:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-08-14 14:25:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-08-14 14:25:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-08-14 14:25:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 60 proven. 243 refuted. 0 times theorem prover too weak. 2142 trivial. 0 not checked. [2024-08-14 14:25:09,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:09,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400101195] [2024-08-14 14:25:09,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400101195] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:09,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518543695] [2024-08-14 14:25:09,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:09,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:09,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:09,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:09,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-14 14:25:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:09,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 47 conjunts are in the unsatisfiable core [2024-08-14 14:25:09,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 295 proven. 251 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2024-08-14 14:25:10,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 102 proven. 269 refuted. 0 times theorem prover too weak. 2074 trivial. 0 not checked. [2024-08-14 14:25:11,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518543695] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:11,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:11,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 23 [2024-08-14 14:25:11,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189539710] [2024-08-14 14:25:11,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:11,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-14 14:25:11,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-14 14:25:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2024-08-14 14:25:11,392 INFO L87 Difference]: Start difference. First operand 452 states and 642 transitions. Second operand has 23 states, 21 states have (on average 5.428571428571429) internal successors, (114), 23 states have internal predecessors, (114), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-08-14 14:25:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:11,870 INFO L93 Difference]: Finished difference Result 1129 states and 1567 transitions. [2024-08-14 14:25:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-14 14:25:11,870 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.428571428571429) internal successors, (114), 23 states have internal predecessors, (114), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 355 [2024-08-14 14:25:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:11,874 INFO L225 Difference]: With dead ends: 1129 [2024-08-14 14:25:11,874 INFO L226 Difference]: Without dead ends: 455 [2024-08-14 14:25:11,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 724 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2024-08-14 14:25:11,876 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:11,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1320 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:25:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-08-14 14:25:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 454. [2024-08-14 14:25:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 417 states have (on average 1.419664268585132) internal successors, (592), 419 states have internal predecessors, (592), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:25:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 628 transitions. [2024-08-14 14:25:11,889 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 628 transitions. Word has length 355 [2024-08-14 14:25:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:11,890 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 628 transitions. [2024-08-14 14:25:11,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.428571428571429) internal successors, (114), 23 states have internal predecessors, (114), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-08-14 14:25:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 628 transitions. [2024-08-14 14:25:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-08-14 14:25:11,895 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:11,895 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:11,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-08-14 14:25:12,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:12,096 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:12,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1860180489, now seen corresponding path program 1 times [2024-08-14 14:25:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:12,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371587754] [2024-08-14 14:25:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-14 14:25:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-08-14 14:25:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-08-14 14:25:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-08-14 14:25:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-08-14 14:25:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-08-14 14:25:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-08-14 14:25:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-08-14 14:25:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-08-14 14:25:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-08-14 14:25:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-08-14 14:25:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-08-14 14:25:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-08-14 14:25:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-08-14 14:25:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-08-14 14:25:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 500 proven. 17 refuted. 0 times theorem prover too weak. 1928 trivial. 0 not checked. [2024-08-14 14:25:13,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371587754] [2024-08-14 14:25:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371587754] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427070030] [2024-08-14 14:25:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:13,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:13,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:13,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:13,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-14 14:25:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:14,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 2048 conjuncts, 48 conjunts are in the unsatisfiable core [2024-08-14 14:25:14,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 578 proven. 17 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2024-08-14 14:25:14,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 500 proven. 17 refuted. 0 times theorem prover too weak. 1928 trivial. 0 not checked. [2024-08-14 14:25:14,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427070030] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:14,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:14,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 21 [2024-08-14 14:25:14,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10966201] [2024-08-14 14:25:14,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:14,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-14 14:25:14,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-14 14:25:14,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-08-14 14:25:14,759 INFO L87 Difference]: Start difference. First operand 454 states and 628 transitions. Second operand has 21 states, 21 states have (on average 7.523809523809524) internal successors, (158), 21 states have internal predecessors, (158), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-08-14 14:25:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:15,019 INFO L93 Difference]: Finished difference Result 494 states and 686 transitions. [2024-08-14 14:25:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-14 14:25:15,020 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.523809523809524) internal successors, (158), 21 states have internal predecessors, (158), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 356 [2024-08-14 14:25:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:15,022 INFO L225 Difference]: With dead ends: 494 [2024-08-14 14:25:15,022 INFO L226 Difference]: Without dead ends: 494 [2024-08-14 14:25:15,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-08-14 14:25:15,023 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 183 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:15,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 762 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:25:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-08-14 14:25:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 478. [2024-08-14 14:25:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 440 states have (on average 1.415909090909091) internal successors, (623), 442 states have internal predecessors, (623), 20 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-08-14 14:25:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 661 transitions. [2024-08-14 14:25:15,034 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 661 transitions. Word has length 356 [2024-08-14 14:25:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:15,034 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 661 transitions. [2024-08-14 14:25:15,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.523809523809524) internal successors, (158), 21 states have internal predecessors, (158), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-08-14 14:25:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 661 transitions. [2024-08-14 14:25:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-08-14 14:25:15,039 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:15,039 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 13, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:15,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-08-14 14:25:15,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:15,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:15,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1417767127, now seen corresponding path program 2 times [2024-08-14 14:25:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:15,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320584884] [2024-08-14 14:25:15,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-14 14:25:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-08-14 14:25:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:25:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-08-14 14:25:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-08-14 14:25:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-08-14 14:25:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-08-14 14:25:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-08-14 14:25:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-08-14 14:25:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-08-14 14:25:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-08-14 14:25:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-08-14 14:25:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-08-14 14:25:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-08-14 14:25:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-08-14 14:25:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2446 backedges. 1099 proven. 18 refuted. 0 times theorem prover too weak. 1329 trivial. 0 not checked. [2024-08-14 14:25:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320584884] [2024-08-14 14:25:16,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320584884] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433778198] [2024-08-14 14:25:16,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:25:16,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:16,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:16,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:16,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-14 14:25:17,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:25:17,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:25:17,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 2051 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-14 14:25:17,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2446 backedges. 713 proven. 390 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2024-08-14 14:25:17,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2446 backedges. 713 proven. 390 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2024-08-14 14:25:17,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433778198] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:17,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:17,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-08-14 14:25:17,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872714415] [2024-08-14 14:25:17,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:17,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-14 14:25:17,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:17,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-14 14:25:17,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-08-14 14:25:17,820 INFO L87 Difference]: Start difference. First operand 478 states and 661 transitions. Second operand has 16 states, 16 states have (on average 12.25) internal successors, (196), 16 states have internal predecessors, (196), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-08-14 14:25:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:18,529 INFO L93 Difference]: Finished difference Result 2786 states and 4015 transitions. [2024-08-14 14:25:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 14:25:18,529 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.25) internal successors, (196), 16 states have internal predecessors, (196), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 357 [2024-08-14 14:25:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:18,540 INFO L225 Difference]: With dead ends: 2786 [2024-08-14 14:25:18,540 INFO L226 Difference]: Without dead ends: 2786 [2024-08-14 14:25:18,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2024-08-14 14:25:18,541 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 179 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:18,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1807 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-14 14:25:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2024-08-14 14:25:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 1392. [2024-08-14 14:25:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1313 states have (on average 1.4234577303884235) internal successors, (1869), 1318 states have internal predecessors, (1869), 61 states have call successors, (61), 18 states have call predecessors, (61), 17 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2024-08-14 14:25:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1989 transitions. [2024-08-14 14:25:18,586 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1989 transitions. Word has length 357 [2024-08-14 14:25:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:18,586 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1989 transitions. [2024-08-14 14:25:18,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.25) internal successors, (196), 16 states have internal predecessors, (196), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-08-14 14:25:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1989 transitions. [2024-08-14 14:25:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-08-14 14:25:18,593 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:18,593 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:18,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-08-14 14:25:18,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:18,794 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:18,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1164774677, now seen corresponding path program 3 times [2024-08-14 14:25:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:18,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585469203] [2024-08-14 14:25:18,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:18,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-14 14:25:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-08-14 14:25:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:25:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-08-14 14:25:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-08-14 14:25:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-08-14 14:25:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-08-14 14:25:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-08-14 14:25:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-08-14 14:25:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-08-14 14:25:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-08-14 14:25:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-08-14 14:25:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-08-14 14:25:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2024-08-14 14:25:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-08-14 14:25:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2473 backedges. 1310 proven. 19 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2024-08-14 14:25:20,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:20,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585469203] [2024-08-14 14:25:20,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585469203] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:20,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44883418] [2024-08-14 14:25:20,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 14:25:20,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:20,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:20,520 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:20,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-14 14:25:20,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-08-14 14:25:20,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:25:20,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 55 conjunts are in the unsatisfiable core [2024-08-14 14:25:20,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2473 backedges. 261 proven. 14 refuted. 0 times theorem prover too weak. 2198 trivial. 0 not checked. [2024-08-14 14:25:22,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2473 backedges. 205 proven. 56 refuted. 0 times theorem prover too weak. 2212 trivial. 0 not checked. [2024-08-14 14:25:24,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44883418] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:24,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:24,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2024-08-14 14:25:24,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107888087] [2024-08-14 14:25:24,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:24,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-14 14:25:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-14 14:25:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-08-14 14:25:24,777 INFO L87 Difference]: Start difference. First operand 1392 states and 1989 transitions. Second operand has 21 states, 21 states have (on average 8.238095238095237) internal successors, (173), 21 states have internal predecessors, (173), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-14 14:25:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:26,136 INFO L93 Difference]: Finished difference Result 3909 states and 5490 transitions. [2024-08-14 14:25:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-08-14 14:25:26,137 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.238095238095237) internal successors, (173), 21 states have internal predecessors, (173), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 363 [2024-08-14 14:25:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:26,151 INFO L225 Difference]: With dead ends: 3909 [2024-08-14 14:25:26,152 INFO L226 Difference]: Without dead ends: 3909 [2024-08-14 14:25:26,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=636, Invalid=2904, Unknown=0, NotChecked=0, Total=3540 [2024-08-14 14:25:26,154 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 137 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:26,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 474 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-08-14 14:25:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3909 states. [2024-08-14 14:25:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3909 to 3892. [2024-08-14 14:25:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3752 states have (on average 1.394189765458422) internal successors, (5231), 3762 states have internal predecessors, (5231), 122 states have call successors, (122), 18 states have call predecessors, (122), 17 states have return successors, (120), 111 states have call predecessors, (120), 120 states have call successors, (120) [2024-08-14 14:25:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5473 transitions. [2024-08-14 14:25:26,226 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5473 transitions. Word has length 363 [2024-08-14 14:25:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:26,227 INFO L495 AbstractCegarLoop]: Abstraction has 3892 states and 5473 transitions. [2024-08-14 14:25:26,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.238095238095237) internal successors, (173), 21 states have internal predecessors, (173), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-14 14:25:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5473 transitions. [2024-08-14 14:25:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-08-14 14:25:26,236 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:26,236 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:26,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-08-14 14:25:26,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:26,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:26,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:26,437 INFO L85 PathProgramCache]: Analyzing trace with hash -569174617, now seen corresponding path program 1 times [2024-08-14 14:25:26,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:26,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939490947] [2024-08-14 14:25:26,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:26,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-14 14:25:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-08-14 14:25:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-08-14 14:25:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:25:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-08-14 14:25:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-08-14 14:25:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-08-14 14:25:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-08-14 14:25:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-08-14 14:25:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-08-14 14:25:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-08-14 14:25:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-08-14 14:25:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-08-14 14:25:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-08-14 14:25:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-08-14 14:25:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2595 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 2297 trivial. 0 not checked. [2024-08-14 14:25:27,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:27,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939490947] [2024-08-14 14:25:27,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939490947] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:25:27,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:25:27,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 14:25:27,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112127862] [2024-08-14 14:25:27,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:25:27,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:25:27,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:25:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:25:27,756 INFO L87 Difference]: Start difference. First operand 3892 states and 5473 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:25:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:27,815 INFO L93 Difference]: Finished difference Result 3691 states and 5189 transitions. [2024-08-14 14:25:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:25:27,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 380 [2024-08-14 14:25:27,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:27,828 INFO L225 Difference]: With dead ends: 3691 [2024-08-14 14:25:27,828 INFO L226 Difference]: Without dead ends: 3691 [2024-08-14 14:25:27,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:25:27,829 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 25 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:27,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 181 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:25:27,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2024-08-14 14:25:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3691. [2024-08-14 14:25:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 3557 states have (on average 1.3941523755974135) internal successors, (4959), 3567 states have internal predecessors, (4959), 116 states have call successors, (116), 18 states have call predecessors, (116), 17 states have return successors, (114), 105 states have call predecessors, (114), 114 states have call successors, (114) [2024-08-14 14:25:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 5189 transitions. [2024-08-14 14:25:27,894 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 5189 transitions. Word has length 380 [2024-08-14 14:25:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:27,894 INFO L495 AbstractCegarLoop]: Abstraction has 3691 states and 5189 transitions. [2024-08-14 14:25:27,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:25:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 5189 transitions. [2024-08-14 14:25:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-08-14 14:25:27,902 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:27,902 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:27,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-14 14:25:27,903 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:27,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2008007972, now seen corresponding path program 2 times [2024-08-14 14:25:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:27,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413173751] [2024-08-14 14:25:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-14 14:25:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-08-14 14:25:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-08-14 14:25:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-08-14 14:25:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-08-14 14:25:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-08-14 14:25:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-08-14 14:25:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-08-14 14:25:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-08-14 14:25:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-08-14 14:25:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-08-14 14:25:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-08-14 14:25:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-08-14 14:25:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-08-14 14:25:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-08-14 14:25:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 544 proven. 19 refuted. 0 times theorem prover too weak. 2042 trivial. 0 not checked. [2024-08-14 14:25:29,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413173751] [2024-08-14 14:25:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413173751] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715290861] [2024-08-14 14:25:29,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:25:29,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:29,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:29,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:29,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-14 14:25:30,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:25:30,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:25:30,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 2143 conjuncts, 20 conjunts are in the unsatisfiable core [2024-08-14 14:25:30,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 622 proven. 19 refuted. 0 times theorem prover too weak. 1964 trivial. 0 not checked. [2024-08-14 14:25:30,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 544 proven. 19 refuted. 0 times theorem prover too weak. 2042 trivial. 0 not checked. [2024-08-14 14:25:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715290861] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:30,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:30,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-08-14 14:25:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464406658] [2024-08-14 14:25:30,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:30,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-14 14:25:30,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:30,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-14 14:25:30,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-08-14 14:25:30,479 INFO L87 Difference]: Start difference. First operand 3691 states and 5189 transitions. Second operand has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 14 states have internal predecessors, (171), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-08-14 14:25:30,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:30,596 INFO L93 Difference]: Finished difference Result 3422 states and 4807 transitions. [2024-08-14 14:25:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:25:30,600 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 14 states have internal predecessors, (171), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 381 [2024-08-14 14:25:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:30,611 INFO L225 Difference]: With dead ends: 3422 [2024-08-14 14:25:30,611 INFO L226 Difference]: Without dead ends: 3422 [2024-08-14 14:25:30,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-08-14 14:25:30,612 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 88 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:30,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 314 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:25:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2024-08-14 14:25:30,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3422. [2024-08-14 14:25:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 3296 states have (on average 1.393507281553398) internal successors, (4593), 3306 states have internal predecessors, (4593), 108 states have call successors, (108), 18 states have call predecessors, (108), 17 states have return successors, (106), 97 states have call predecessors, (106), 106 states have call successors, (106) [2024-08-14 14:25:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4807 transitions. [2024-08-14 14:25:30,680 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4807 transitions. Word has length 381 [2024-08-14 14:25:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:30,680 INFO L495 AbstractCegarLoop]: Abstraction has 3422 states and 4807 transitions. [2024-08-14 14:25:30,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 14 states have internal predecessors, (171), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-08-14 14:25:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4807 transitions. [2024-08-14 14:25:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-08-14 14:25:30,689 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:30,689 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:30,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-08-14 14:25:30,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:30,890 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:30,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1116080477, now seen corresponding path program 3 times [2024-08-14 14:25:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:30,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014706198] [2024-08-14 14:25:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-14 14:25:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-08-14 14:25:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-08-14 14:25:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-08-14 14:25:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-08-14 14:25:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-08-14 14:25:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-08-14 14:25:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-08-14 14:25:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-08-14 14:25:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:34,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-08-14 14:25:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:35,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-14 14:25:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:35,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-08-14 14:25:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-08-14 14:25:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:35,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-08-14 14:25:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:35,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-08-14 14:25:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1250 proven. 91 refuted. 0 times theorem prover too weak. 1264 trivial. 0 not checked. [2024-08-14 14:25:35,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:35,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014706198] [2024-08-14 14:25:35,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014706198] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:35,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869896937] [2024-08-14 14:25:35,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 14:25:35,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:35,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:35,013 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:35,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-14 14:25:35,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-08-14 14:25:35,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:25:35,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 86 conjunts are in the unsatisfiable core [2024-08-14 14:25:35,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 399 proven. 80 refuted. 0 times theorem prover too weak. 2126 trivial. 0 not checked. [2024-08-14 14:25:36,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 191 proven. 275 refuted. 0 times theorem prover too weak. 2139 trivial. 0 not checked. [2024-08-14 14:25:39,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869896937] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:39,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:39,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 16] total 44 [2024-08-14 14:25:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503661558] [2024-08-14 14:25:39,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:39,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-08-14 14:25:39,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:39,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-08-14 14:25:39,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1666, Unknown=0, NotChecked=0, Total=1892 [2024-08-14 14:25:39,628 INFO L87 Difference]: Start difference. First operand 3422 states and 4807 transitions. Second operand has 44 states, 42 states have (on average 5.714285714285714) internal successors, (240), 44 states have internal predecessors, (240), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-08-14 14:25:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:42,855 INFO L93 Difference]: Finished difference Result 1235 states and 1688 transitions. [2024-08-14 14:25:42,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-08-14 14:25:42,856 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 5.714285714285714) internal successors, (240), 44 states have internal predecessors, (240), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 381 [2024-08-14 14:25:42,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:42,860 INFO L225 Difference]: With dead ends: 1235 [2024-08-14 14:25:42,860 INFO L226 Difference]: Without dead ends: 1235 [2024-08-14 14:25:42,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 768 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2308 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1428, Invalid=7884, Unknown=0, NotChecked=0, Total=9312 [2024-08-14 14:25:42,864 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 557 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:42,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 584 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-08-14 14:25:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2024-08-14 14:25:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 619. [2024-08-14 14:25:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 582 states have (on average 1.3539518900343643) internal successors, (788), 584 states have internal predecessors, (788), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:25:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 824 transitions. [2024-08-14 14:25:42,879 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 824 transitions. Word has length 381 [2024-08-14 14:25:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:42,880 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 824 transitions. [2024-08-14 14:25:42,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 5.714285714285714) internal successors, (240), 44 states have internal predecessors, (240), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-08-14 14:25:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 824 transitions. [2024-08-14 14:25:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-08-14 14:25:42,882 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:42,883 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:42,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-08-14 14:25:43,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-08-14 14:25:43,084 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:43,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2044656794, now seen corresponding path program 1 times [2024-08-14 14:25:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:43,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964170943] [2024-08-14 14:25:43,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:25:44,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:25:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:25:46,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:25:46,603 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:25:46,604 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:25:46,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-14 14:25:46,608 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:46,613 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:25:46,745 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:25:46 BoogieIcfgContainer [2024-08-14 14:25:46,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:25:46,748 INFO L158 Benchmark]: Toolchain (without parser) took 53712.49ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 141.7MB in the beginning and 758.9MB in the end (delta: -617.2MB). Peak memory consumption was 730.3MB. Max. memory is 16.1GB. [2024-08-14 14:25:46,748 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:25:46,748 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 178.3MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:25:46,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.38ms. Allocated memory is still 178.3MB. Free memory was 141.7MB in the beginning and 128.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-08-14 14:25:46,749 INFO L158 Benchmark]: Boogie Preprocessor took 89.45ms. Allocated memory is still 178.3MB. Free memory was 128.1MB in the beginning and 126.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:25:46,749 INFO L158 Benchmark]: IcfgBuilder took 741.63ms. Allocated memory is still 178.3MB. Free memory was 126.0MB in the beginning and 125.8MB in the end (delta: 227.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-14 14:25:46,749 INFO L158 Benchmark]: TraceAbstraction took 52558.91ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 125.8MB in the beginning and 758.9MB in the end (delta: -633.1MB). Peak memory consumption was 715.4MB. Max. memory is 16.1GB. [2024-08-14 14:25:46,750 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.32ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.19ms. Allocated memory is still 178.3MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.38ms. Allocated memory is still 178.3MB. Free memory was 141.7MB in the beginning and 128.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.45ms. Allocated memory is still 178.3MB. Free memory was 128.1MB in the beginning and 126.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 741.63ms. Allocated memory is still 178.3MB. Free memory was 126.0MB in the beginning and 125.8MB in the end (delta: 227.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 52558.91ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 125.8MB in the beginning and 758.9MB in the end (delta: -633.1MB). Peak memory consumption was 715.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 69. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L32] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L33] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_1 var_13 = 1; [L37] const SORT_1 var_17 = 0; [L38] const SORT_23 var_25 = 1; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L44] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L45] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L46] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_9_arg_1 = var_5; [L51] state_8 = init_9_arg_1 [L52] SORT_1 init_19_arg_1 = var_17; [L53] state_18 = init_19_arg_1 [L54] SORT_1 init_21_arg_1 = var_17; [L55] state_20 = init_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_24_arg_0=0, var_25=1, var_28=1] [L78] EXPR var_24_arg_0 & mask_SORT_4 [L78] EXPR var_24_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1, var_28=1] [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_29=0] [L89] EXPR var_29 & mask_SORT_4 [L89] EXPR var_29 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1, var_31_arg_0=0] [L92] EXPR var_31_arg_0 & mask_SORT_4 [L92] EXPR var_31_arg_0 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, state_8=0, var_13=1, var_25=1, var_28=1] [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1, var_34=1] [L103] EXPR var_34 & mask_SORT_4 [L103] EXPR var_34 & mask_SORT_4 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, state_18=0, state_20=0, var_13=1, var_25=1] [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1, var_36=-1] [L107] EXPR var_36 & mask_SORT_1 [L107] EXPR var_36 & mask_SORT_1 VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, next_30_arg_1=0, next_35_arg_1=0, state_18=0, var_13=1, var_25=1] [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15=1, var_25=1] [L70] EXPR var_15 & mask_SORT_1 [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=1, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=0] [L21] COND TRUE !(cond) VAL [\old(cond)=0] [L21] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.4s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1520 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1513 mSDsluCounter, 6593 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5783 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5349 IncrementalHoareTripleChecker+Invalid, 5416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 810 mSDtfsCounter, 5349 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5966 GetRequests, 5674 SyntacticMatches, 2 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3806 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3892occurred in iteration=8, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 2779 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 7190 NumberOfCodeBlocks, 6566 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 9313 ConstructedInterpolants, 0 QuantifiedInterpolants, 46242 SizeOfPredicates, 29 NumberOfNonLiveVariables, 12908 ConjunctsInSsa, 407 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 61629/63930 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-08-14 14:25:46,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.dyn_partition.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:25:49,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:25:49,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-14 14:25:49,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:25:49,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:25:49,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:25:49,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:25:49,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:25:49,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:25:49,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:25:49,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:25:49,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:25:49,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:25:49,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:25:49,167 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:25:49,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:25:49,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:25:49,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:25:49,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:25:49,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:25:49,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:25:49,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:25:49,174 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:25:49,174 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:25:49,175 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:25:49,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:25:49,175 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:25:49,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:25:49,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:25:49,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:25:49,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:25:49,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:25:49,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:25:49,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:25:49,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:25:49,178 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:25:49,178 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:25:49,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:25:49,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:25:49,179 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:25:49,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:25:49,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:25:49,181 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:25:49,181 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:25:49,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:25:49,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:25:49,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:25:49,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:25:49,520 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:25:49,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-08-14 14:25:51,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:25:51,296 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:25:51,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-08-14 14:25:51,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010dbe778/b3a9ad2317f5421aa228b6f51ec5239e/FLAG5a04f75f0 [2024-08-14 14:25:51,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010dbe778/b3a9ad2317f5421aa228b6f51ec5239e [2024-08-14 14:25:51,330 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:25:51,332 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:25:51,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.dyn_partition.yml/witness.yml [2024-08-14 14:25:51,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:25:51,455 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:25:51,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:25:51,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:25:51,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:25:51,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:25:51" (1/2) ... [2024-08-14 14:25:51,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d8a86b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:51, skipping insertion in model container [2024-08-14 14:25:51,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:25:51" (1/2) ... [2024-08-14 14:25:51,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@c09af81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:51, skipping insertion in model container [2024-08-14 14:25:51,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:25:51" (2/2) ... [2024-08-14 14:25:51,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d8a86b2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51, skipping insertion in model container [2024-08-14 14:25:51,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:25:51" (2/2) ... [2024-08-14 14:25:51,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:25:51,675 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-08-14 14:25:51,733 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:25:51,748 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:25:51,763 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-08-14 14:25:51,795 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:25:51,817 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:25:51,818 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51 WrapperNode [2024-08-14 14:25:51,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:25:51,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:25:51,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:25:51,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:25:51,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51" (1/1) ... [2024-08-14 14:25:51,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51" (1/1) ... [2024-08-14 14:25:51,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51" (1/1) ... [2024-08-14 14:25:51,867 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-08-14 14:25:51,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51" (1/1) ... [2024-08-14 14:25:51,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51" (1/1) ... [2024-08-14 14:25:51,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51" (1/1) ... [2024-08-14 14:25:51,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51" (1/1) ... [2024-08-14 14:25:51,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51" (1/1) ... [2024-08-14 14:25:51,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:25:51,892 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:25:51,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:25:51,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:25:51,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51" (1/1) ... [2024-08-14 14:25:51,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:25:51,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:51,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:25:51,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:25:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:25:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:25:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:25:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:25:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:25:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:25:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:25:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:25:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:25:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:25:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:25:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:25:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:25:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:25:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:25:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:25:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:25:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:25:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:25:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:25:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:25:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:25:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:25:52,078 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:25:52,080 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:25:52,356 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-08-14 14:25:52,356 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:25:52,367 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:25:52,368 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:25:52,369 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:25:52 BoogieIcfgContainer [2024-08-14 14:25:52,370 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:25:52,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:25:52,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:25:52,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:25:52,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:25:51" (1/4) ... [2024-08-14 14:25:52,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344db6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:25:52, skipping insertion in model container [2024-08-14 14:25:52,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:25:51" (2/4) ... [2024-08-14 14:25:52,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344db6cd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:25:52, skipping insertion in model container [2024-08-14 14:25:52,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:51" (3/4) ... [2024-08-14 14:25:52,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344db6cd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:25:52, skipping insertion in model container [2024-08-14 14:25:52,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:25:52" (4/4) ... [2024-08-14 14:25:52,380 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-08-14 14:25:52,381 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:25:52,402 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:25:52,403 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:25:52,433 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [48] [2024-08-14 14:25:52,437 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:25:52,542 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 416 states to 236 states. [2024-08-14 14:25:52,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:25:52,572 INFO L357 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, mHoare=false, 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;@4d145d2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:25:52,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:25:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2024-08-14 14:25:52,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-08-14 14:25:52,592 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:52,593 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:52,607 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:52,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash 84472225, now seen corresponding path program 1 times [2024-08-14 14:25:52,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:25:52,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100528696] [2024-08-14 14:25:52,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:52,633 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-08-14 14:25:52,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:25:52,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-08-14 14:25:52,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:25:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:25:53,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:25:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:25:53,493 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:25:53,495 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:25:53,496 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:25:53,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-08-14 14:25:53,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-08-14 14:25:53,705 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:25:53,708 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:25:53,771 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:25:53 BoogieIcfgContainer [2024-08-14 14:25:53,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:25:53,773 INFO L158 Benchmark]: Toolchain (without parser) took 2317.82ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 34.2MB in the beginning and 40.7MB in the end (delta: -6.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-08-14 14:25:53,773 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory was 24.5MB in the beginning and 24.4MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:25:53,773 INFO L158 Benchmark]: Witness Parser took 0.10ms. Allocated memory is still 69.2MB. Free memory is still 38.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:25:53,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.50ms. Allocated memory is still 69.2MB. Free memory was 34.1MB in the beginning and 40.1MB in the end (delta: -6.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-08-14 14:25:53,774 INFO L158 Benchmark]: Boogie Preprocessor took 70.73ms. Allocated memory is still 69.2MB. Free memory was 40.1MB in the beginning and 37.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:25:53,775 INFO L158 Benchmark]: IcfgBuilder took 478.94ms. Allocated memory is still 69.2MB. Free memory was 37.6MB in the beginning and 40.1MB in the end (delta: -2.5MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-08-14 14:25:53,775 INFO L158 Benchmark]: TraceAbstraction took 1399.61ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 39.3MB in the beginning and 40.7MB in the end (delta: -1.3MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-08-14 14:25:53,777 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.14ms. Allocated memory is still 48.2MB. Free memory was 24.5MB in the beginning and 24.4MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.10ms. Allocated memory is still 69.2MB. Free memory is still 38.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.50ms. Allocated memory is still 69.2MB. Free memory was 34.1MB in the beginning and 40.1MB in the end (delta: -6.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.73ms. Allocated memory is still 69.2MB. Free memory was 40.1MB in the beginning and 37.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 478.94ms. Allocated memory is still 69.2MB. Free memory was 37.6MB in the beginning and 40.1MB in the end (delta: -2.5MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1399.61ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 39.3MB in the beginning and 40.7MB in the end (delta: -1.3MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L32] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L33] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_1 var_13 = 1; [L37] const SORT_1 var_17 = 0; [L38] const SORT_23 var_25 = 1; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_9_arg_1 = var_5; [L51] state_8 = init_9_arg_1 [L52] SORT_1 init_19_arg_1 = var_17; [L53] state_18 = init_19_arg_1 [L54] SORT_1 init_21_arg_1 = var_17; [L55] state_20 = init_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=0, state_6=0, state_8=1, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=0, state_6=0, state_8=1, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=1, state_6=1, state_8=1, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=1, state_6=1, state_8=1, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=1, state_6=1, state_8=2, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=1, state_6=1, state_8=2, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=2, state_8=2, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=2, state_8=2, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=0, state_6=2, state_8=3, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=0, state_6=2, state_8=3, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=1, state_6=3, state_8=3, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=1, state_6=3, state_8=3, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=1, state_6=3, state_8=4, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=1, state_6=3, state_8=4, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=4, state_8=4, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=4, state_8=4, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=0, state_6=4, state_8=5, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=0, state_6=4, state_8=5, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=1, state_6=5, state_8=5, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=1, state_6=5, state_8=5, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=1, state_6=5, state_8=6, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=1, state_6=5, state_8=6, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=6, state_8=6, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=6, state_8=6, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=0, state_6=6, state_8=7, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=0, state_6=6, state_8=7, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=1, state_6=7, state_8=7, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) VAL [bad_16_arg_0=0, mask_SORT_1=1, mask_SORT_4=7, state_18=1, state_20=1, state_6=7, state_8=7, var_13=1, var_25=1] [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; VAL [bad_16_arg_0=1, mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=1, state_6=7, state_8=0, var_13=1, var_25=1] [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) VAL [\old(cond)=0] [L21] COND TRUE !(cond) VAL [\old(cond)=0] [L21] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 1, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-14 14:25:53,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE