./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 03fe66fa 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-03fe66f-m [2024-08-15 18:18:39,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:18:40,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-15 18:18:40,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:18:40,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:18:40,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:18:40,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:18:40,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:18:40,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:18:40,063 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:18:40,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:18:40,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:18:40,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:18:40,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:18:40,065 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:18:40,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:18:40,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:18:40,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-15 18:18:40,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:18:40,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:18:40,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:18:40,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:18:40,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:18:40,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:18:40,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:18:40,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:18:40,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:18:40,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:18:40,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:18:40,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:18:40,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:18:40,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:18:40,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:18:40,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-15 18:18:40,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-15 18:18:40,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:18:40,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:18:40,073 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:18:40,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:18:40,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:18:40,074 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-15 18:18:40,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:18:40,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:18:40,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:18:40,364 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:18:40,365 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:18:40,366 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-15 18:18:40,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:18:40,545 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:18:40,546 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-15 18:18:42,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:18:42,279 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:18:42,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-08-15 18:18:42,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72ad0e56/231858cbd4a7434e8fdbe3923e6abb78/FLAG3152455c0 [2024-08-15 18:18:42,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72ad0e56/231858cbd4a7434e8fdbe3923e6abb78 [2024-08-15 18:18:42,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:18:42,304 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:18:42,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:18:42,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:18:42,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:18:42,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:18:40" (1/2) ... [2024-08-15 18:18:42,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b292677 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:18:42, skipping insertion in model container [2024-08-15 18:18:42,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:18:40" (1/2) ... [2024-08-15 18:18:42,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@12aa8644 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:18:42, skipping insertion in model container [2024-08-15 18:18:42,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:18:42" (2/2) ... [2024-08-15 18:18:42,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b292677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42, skipping insertion in model container [2024-08-15 18:18:42,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:18:42" (2/2) ... [2024-08-15 18:18:42,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:18:42,478 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-15 18:18:42,530 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:18:42,541 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:18:42,553 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-15 18:18:42,610 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:18:42,633 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:18:42,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42 WrapperNode [2024-08-15 18:18:42,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:18:42,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:18:42,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:18:42,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:18:42,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42" (1/1) ... [2024-08-15 18:18:42,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42" (1/1) ... [2024-08-15 18:18:42,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42" (1/1) ... [2024-08-15 18:18:42,702 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-15 18:18:42,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42" (1/1) ... [2024-08-15 18:18:42,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42" (1/1) ... [2024-08-15 18:18:42,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42" (1/1) ... [2024-08-15 18:18:42,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42" (1/1) ... [2024-08-15 18:18:42,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42" (1/1) ... [2024-08-15 18:18:42,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:18:42,732 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:18:42,732 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:18:42,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:18:42,733 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42" (1/1) ... [2024-08-15 18:18:42,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:18:42,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:18:42,783 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-15 18:18:42,791 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-15 18:18:42,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:18:42,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:18:42,843 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:18:42,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:18:42,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:18:42,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:18:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:18:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:18:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:18:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:18:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:18:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:18:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:18:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:18:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:18:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:18:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:18:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:18:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-15 18:18:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:18:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-15 18:18:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-15 18:18:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:18:42,956 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:18:42,958 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:18:43,419 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-08-15 18:18:43,419 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:18:43,428 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:18:43,429 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:18:43,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:18:43 BoogieIcfgContainer [2024-08-15 18:18:43,429 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:18:43,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:18:43,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:18:43,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:18:43,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:18:40" (1/4) ... [2024-08-15 18:18:43,437 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:18:43,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5cd0c9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:18:43, skipping insertion in model container [2024-08-15 18:18:43,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:18:42" (2/4) ... [2024-08-15 18:18:43,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5cd0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:18:43, skipping insertion in model container [2024-08-15 18:18:43,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:18:42" (3/4) ... [2024-08-15 18:18:43,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5cd0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:18:43, skipping insertion in model container [2024-08-15 18:18:43,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:18:43" (4/4) ... [2024-08-15 18:18:43,443 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-08-15 18:18:43,466 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:18:43,467 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:18:43,500 INFO L90 WitnessUtils]: Constructing product of automaton with 54 states and violation witness of the following lengths: [48] [2024-08-15 18:18:43,728 INFO L95 WitnessUtils]: Product has 1106 reachable states. [2024-08-15 18:18:43,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:18:43,768 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;@6d5521ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:18:43,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:18:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1617 transitions. [2024-08-15 18:18:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-08-15 18:18:43,808 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:18:43,810 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-15 18:18:43,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:18:43,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:18:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1449129408, now seen corresponding path program 1 times [2024-08-15 18:18:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:18:43,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701644404] [2024-08-15 18:18:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:18:43,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:18:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:18:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-08-15 18:18:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-15 18:18:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-15 18:18:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-15 18:18:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-08-15 18:18:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-08-15 18:18:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-15 18:18:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-08-15 18:18:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-08-15 18:18:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-08-15 18:18:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-08-15 18:18:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-15 18:18:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-08-15 18:18:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-08-15 18:18:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2024-08-15 18:18:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:46,914 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-15 18:18:46,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:18:46,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701644404] [2024-08-15 18:18:46,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701644404] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:18:46,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:18:46,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:18:46,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330136061] [2024-08-15 18:18:46,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:18:46,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:18:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:18:46,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:18:46,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:18:46,970 INFO L87 Difference]: Start difference. First operand 1106 states and 1617 transitions. 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-15 18:18:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:18:47,059 INFO L93 Difference]: Finished difference Result 860 states and 1258 transitions. [2024-08-15 18:18:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:18:47,067 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-15 18:18:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:18:47,094 INFO L225 Difference]: With dead ends: 860 [2024-08-15 18:18:47,094 INFO L226 Difference]: Without dead ends: 830 [2024-08-15 18:18:47,097 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-15 18:18:47,101 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-15 18:18:47,103 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-15 18:18:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-08-15 18:18:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 452. [2024-08-15 18:18:47,208 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-15 18:18:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 674 transitions. [2024-08-15 18:18:47,221 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 674 transitions. Word has length 338 [2024-08-15 18:18:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:18:47,225 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 674 transitions. [2024-08-15 18:18:47,225 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-15 18:18:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 674 transitions. [2024-08-15 18:18:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-08-15 18:18:47,232 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:18:47,232 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-15 18:18:47,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-15 18:18:47,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:18:47,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:18:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash 355720381, now seen corresponding path program 1 times [2024-08-15 18:18:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:18:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920778709] [2024-08-15 18:18:47,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:18:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:18:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:18:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-08-15 18:18:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-15 18:18:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-15 18:18:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-15 18:18:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-08-15 18:18:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-08-15 18:18:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-15 18:18:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-08-15 18:18:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-08-15 18:18:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-08-15 18:18:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-08-15 18:18:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-15 18:18:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-08-15 18:18:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-08-15 18:18:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2024-08-15 18:18:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:48,584 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-15 18:18:48,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:18:48,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920778709] [2024-08-15 18:18:48,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920778709] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:18:48,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:18:48,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-15 18:18:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857983192] [2024-08-15 18:18:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:18:48,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-15 18:18:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:18:48,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-15 18:18:48,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:18:48,591 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-15 18:18:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:18:48,620 INFO L93 Difference]: Finished difference Result 484 states and 706 transitions. [2024-08-15 18:18:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-15 18:18:48,621 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-15 18:18:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:18:48,626 INFO L225 Difference]: With dead ends: 484 [2024-08-15 18:18:48,626 INFO L226 Difference]: Without dead ends: 484 [2024-08-15 18:18:48,630 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-15 18:18:48,631 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-15 18:18:48,632 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-15 18:18:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-08-15 18:18:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 482. [2024-08-15 18:18:48,662 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-15 18:18:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 704 transitions. [2024-08-15 18:18:48,673 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 704 transitions. Word has length 339 [2024-08-15 18:18:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:18:48,675 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 704 transitions. [2024-08-15 18:18:48,675 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-15 18:18:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 704 transitions. [2024-08-15 18:18:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-08-15 18:18:48,682 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:18:48,682 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-15 18:18:48,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-15 18:18:48,683 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:18:48,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:18:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1765603421, now seen corresponding path program 1 times [2024-08-15 18:18:48,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:18:48,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119010979] [2024-08-15 18:18:48,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:18:48,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:18:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:18:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-08-15 18:18:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-15 18:18:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-15 18:18:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-15 18:18:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-08-15 18:18:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-08-15 18:18:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-15 18:18:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-08-15 18:18:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-08-15 18:18:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-08-15 18:18:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-08-15 18:18:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-15 18:18:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-08-15 18:18:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-08-15 18:18:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2024-08-15 18:18:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:50,764 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-15 18:18:50,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:18:50,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119010979] [2024-08-15 18:18:50,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119010979] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:18:50,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221681445] [2024-08-15 18:18:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:18:50,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:18:50,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:18:50,773 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-15 18:18:50,774 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-15 18:18:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:51,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 1984 conjuncts, 70 conjunts are in the unsatisfiable core [2024-08-15 18:18:51,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:18:51,775 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-15 18:18:51,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-15 18:18:51,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221681445] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:18:51,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-15 18:18:51,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2024-08-15 18:18:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832615041] [2024-08-15 18:18:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:18:51,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-15 18:18:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:18:51,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-15 18:18:51,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-08-15 18:18:51,779 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-15 18:18:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:18:51,898 INFO L93 Difference]: Finished difference Result 480 states and 700 transitions. [2024-08-15 18:18:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-15 18:18:51,900 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-15 18:18:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:18:51,903 INFO L225 Difference]: With dead ends: 480 [2024-08-15 18:18:51,904 INFO L226 Difference]: Without dead ends: 480 [2024-08-15 18:18:51,904 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-15 18:18:51,908 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-15 18:18:51,908 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-15 18:18:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-08-15 18:18:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2024-08-15 18:18:51,920 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-15 18:18:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 700 transitions. [2024-08-15 18:18:51,922 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 700 transitions. Word has length 340 [2024-08-15 18:18:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:18:51,923 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 700 transitions. [2024-08-15 18:18:51,923 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-15 18:18:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 700 transitions. [2024-08-15 18:18:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-08-15 18:18:51,927 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:18:51,928 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-15 18:18:51,955 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-15 18:18:52,128 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-15 18:18:52,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:18:52,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:18:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1771785614, now seen corresponding path program 1 times [2024-08-15 18:18:52,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:18:52,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886215555] [2024-08-15 18:18:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:18:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:18:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:18:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-15 18:18:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:18:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-08-15 18:18:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-08-15 18:18:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-08-15 18:18:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-08-15 18:18:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-08-15 18:18:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-08-15 18:18:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-08-15 18:18:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-08-15 18:18:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-08-15 18:18:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-08-15 18:18:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-08-15 18:18:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-08-15 18:18:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-08-15 18:18:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:53,975 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-15 18:18:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:18:53,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886215555] [2024-08-15 18:18:53,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886215555] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:18:53,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185780820] [2024-08-15 18:18:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:18:53,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:18:53,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:18:53,981 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-15 18:18:53,984 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-15 18:18:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:54,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 69 conjunts are in the unsatisfiable core [2024-08-15 18:18:54,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:18:55,762 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-15 18:18:55,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:18:57,536 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-15 18:18:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185780820] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:18:57,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:18:57,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 9] total 22 [2024-08-15 18:18:57,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261509522] [2024-08-15 18:18:57,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:18:57,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-15 18:18:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:18:57,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-15 18:18:57,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2024-08-15 18:18:57,541 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-15 18:18:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:18:57,949 INFO L93 Difference]: Finished difference Result 807 states and 1160 transitions. [2024-08-15 18:18:57,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-15 18:18:57,951 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-15 18:18:57,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:18:57,954 INFO L225 Difference]: With dead ends: 807 [2024-08-15 18:18:57,954 INFO L226 Difference]: Without dead ends: 807 [2024-08-15 18:18:57,956 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-15 18:18:57,958 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 129 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:18:57,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 557 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-15 18:18:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-08-15 18:18:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 452. [2024-08-15 18:18:57,977 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-15 18:18:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 642 transitions. [2024-08-15 18:18:57,980 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 642 transitions. Word has length 341 [2024-08-15 18:18:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:18:57,981 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 642 transitions. [2024-08-15 18:18:57,981 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-15 18:18:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 642 transitions. [2024-08-15 18:18:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-08-15 18:18:57,986 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:18:57,986 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-15 18:18:58,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-15 18:18:58,190 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-15 18:18:58,191 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:18:58,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:18:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash -677566355, now seen corresponding path program 1 times [2024-08-15 18:18:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:18:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137645753] [2024-08-15 18:18:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:18:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:18:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:18:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-15 18:18:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-08-15 18:18:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-08-15 18:18:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-08-15 18:18:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-08-15 18:18:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-08-15 18:18:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-08-15 18:18:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-08-15 18:18:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-08-15 18:18:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-08-15 18:18:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-08-15 18:18:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-08-15 18:18:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-08-15 18:18:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-08-15 18:18:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-08-15 18:18:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:18:59,987 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-15 18:18:59,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:18:59,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137645753] [2024-08-15 18:18:59,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137645753] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:18:59,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390602716] [2024-08-15 18:18:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:18:59,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:18:59,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:18:59,992 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-15 18:18:59,994 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-15 18:19:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:00,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 47 conjunts are in the unsatisfiable core [2024-08-15 18:19:00,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:19:01,492 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-15 18:19:01,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:19:02,246 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-15 18:19:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390602716] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:19:02,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:19:02,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 23 [2024-08-15 18:19:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290659675] [2024-08-15 18:19:02,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:19:02,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-15 18:19:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-15 18:19:02,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2024-08-15 18:19:02,249 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-15 18:19:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:02,743 INFO L93 Difference]: Finished difference Result 1129 states and 1567 transitions. [2024-08-15 18:19:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-15 18:19:02,744 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-15 18:19:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:02,747 INFO L225 Difference]: With dead ends: 1129 [2024-08-15 18:19:02,748 INFO L226 Difference]: Without dead ends: 455 [2024-08-15 18:19:02,748 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-15 18:19:02,749 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 131 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:02,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1292 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-15 18:19:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-08-15 18:19:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 454. [2024-08-15 18:19:02,761 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-15 18:19:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 628 transitions. [2024-08-15 18:19:02,763 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 628 transitions. Word has length 355 [2024-08-15 18:19:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:02,763 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 628 transitions. [2024-08-15 18:19:02,764 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-15 18:19:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 628 transitions. [2024-08-15 18:19:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-08-15 18:19:02,769 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:02,769 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-15 18:19:02,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-08-15 18:19:02,973 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-15 18:19:02,974 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:02,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1860180489, now seen corresponding path program 1 times [2024-08-15 18:19:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:02,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918613062] [2024-08-15 18:19:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-15 18:19:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-08-15 18:19:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-08-15 18:19:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-08-15 18:19:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-08-15 18:19:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-08-15 18:19:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-08-15 18:19:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-08-15 18:19:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-08-15 18:19:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-08-15 18:19:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-08-15 18:19:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-08-15 18:19:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-08-15 18:19:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-08-15 18:19:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-08-15 18:19:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:04,443 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-15 18:19:04,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918613062] [2024-08-15 18:19:04,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918613062] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:19:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577129621] [2024-08-15 18:19:04,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:04,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:04,446 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-15 18:19:04,448 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-15 18:19:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:05,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 2048 conjuncts, 48 conjunts are in the unsatisfiable core [2024-08-15 18:19:05,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:19:05,465 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-15 18:19:05,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:19:05,863 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-15 18:19:05,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577129621] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:19:05,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:19:05,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 21 [2024-08-15 18:19:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301032374] [2024-08-15 18:19:05,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:19:05,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-15 18:19:05,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:05,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-15 18:19:05,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-08-15 18:19:05,867 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-15 18:19:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:06,103 INFO L93 Difference]: Finished difference Result 494 states and 686 transitions. [2024-08-15 18:19:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-15 18:19:06,103 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-15 18:19:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:06,106 INFO L225 Difference]: With dead ends: 494 [2024-08-15 18:19:06,106 INFO L226 Difference]: Without dead ends: 494 [2024-08-15 18:19:06,106 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-15 18:19:06,107 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 185 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:06,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 775 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-15 18:19:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-08-15 18:19:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 478. [2024-08-15 18:19:06,119 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-15 18:19:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 661 transitions. [2024-08-15 18:19:06,122 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 661 transitions. Word has length 356 [2024-08-15 18:19:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:06,122 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 661 transitions. [2024-08-15 18:19:06,122 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-15 18:19:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 661 transitions. [2024-08-15 18:19:06,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-08-15 18:19:06,127 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:06,127 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-15 18:19:06,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-15 18:19:06,331 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-15 18:19:06,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:06,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1417767127, now seen corresponding path program 2 times [2024-08-15 18:19:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:06,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901285442] [2024-08-15 18:19:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-15 18:19:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-08-15 18:19:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-15 18:19:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-08-15 18:19:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-08-15 18:19:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-08-15 18:19:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-08-15 18:19:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-08-15 18:19:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-08-15 18:19:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-08-15 18:19:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-08-15 18:19:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-08-15 18:19:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-08-15 18:19:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-08-15 18:19:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-08-15 18:19:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:07,738 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-15 18:19:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:07,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901285442] [2024-08-15 18:19:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901285442] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:19:07,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208091062] [2024-08-15 18:19:07,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-15 18:19:07,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:07,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:07,741 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-15 18:19:07,743 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-15 18:19:08,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-15 18:19:08,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-15 18:19:08,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 2051 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-15 18:19:08,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:19:08,903 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-15 18:19:08,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:19:09,328 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-15 18:19:09,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208091062] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:19:09,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:19:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-08-15 18:19:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923323678] [2024-08-15 18:19:09,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:19:09,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-15 18:19:09,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:09,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-15 18:19:09,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-08-15 18:19:09,332 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-15 18:19:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:10,165 INFO L93 Difference]: Finished difference Result 2786 states and 4015 transitions. [2024-08-15 18:19:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-15 18:19:10,171 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-15 18:19:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:10,183 INFO L225 Difference]: With dead ends: 2786 [2024-08-15 18:19:10,183 INFO L226 Difference]: Without dead ends: 2786 [2024-08-15 18:19:10,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2024-08-15 18:19:10,185 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 125 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:10,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 2339 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-15 18:19:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2024-08-15 18:19:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 1392. [2024-08-15 18:19:10,239 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-15 18:19:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1989 transitions. [2024-08-15 18:19:10,247 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1989 transitions. Word has length 357 [2024-08-15 18:19:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:10,248 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1989 transitions. [2024-08-15 18:19:10,248 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-15 18:19:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1989 transitions. [2024-08-15 18:19:10,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-08-15 18:19:10,258 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:10,258 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-15 18:19:10,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-08-15 18:19:10,459 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-15 18:19:10,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:10,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1164774677, now seen corresponding path program 3 times [2024-08-15 18:19:10,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:10,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928033148] [2024-08-15 18:19:10,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:10,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-15 18:19:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-08-15 18:19:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-15 18:19:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-08-15 18:19:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-08-15 18:19:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-08-15 18:19:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-08-15 18:19:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-08-15 18:19:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-08-15 18:19:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-08-15 18:19:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-08-15 18:19:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-08-15 18:19:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-08-15 18:19:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2024-08-15 18:19:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-08-15 18:19:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:12,393 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-15 18:19:12,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:12,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928033148] [2024-08-15 18:19:12,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928033148] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:19:12,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299976695] [2024-08-15 18:19:12,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-15 18:19:12,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:12,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:12,396 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-15 18:19:12,397 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-15 18:19:12,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-08-15 18:19:12,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-15 18:19:12,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 55 conjunts are in the unsatisfiable core [2024-08-15 18:19:12,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:19:14,456 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-15 18:19:14,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:19:17,156 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-15 18:19:17,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299976695] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:19:17,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:19:17,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2024-08-15 18:19:17,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071697759] [2024-08-15 18:19:17,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:19:17,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-15 18:19:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:17,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-15 18:19:17,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-08-15 18:19:17,160 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-15 18:19:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:18,711 INFO L93 Difference]: Finished difference Result 3909 states and 5490 transitions. [2024-08-15 18:19:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-08-15 18:19:18,712 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-15 18:19:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:18,729 INFO L225 Difference]: With dead ends: 3909 [2024-08-15 18:19:18,729 INFO L226 Difference]: Without dead ends: 3909 [2024-08-15 18:19:18,731 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-15 18:19:18,732 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 159 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:18,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 485 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-08-15 18:19:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3909 states. [2024-08-15 18:19:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3909 to 3892. [2024-08-15 18:19:18,825 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-15 18:19:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5473 transitions. [2024-08-15 18:19:18,846 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5473 transitions. Word has length 363 [2024-08-15 18:19:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:18,846 INFO L495 AbstractCegarLoop]: Abstraction has 3892 states and 5473 transitions. [2024-08-15 18:19:18,847 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-15 18:19:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5473 transitions. [2024-08-15 18:19:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-08-15 18:19:18,863 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:18,863 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-15 18:19:18,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-08-15 18:19:19,067 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-15 18:19:19,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:19,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash -569174617, now seen corresponding path program 1 times [2024-08-15 18:19:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500005931] [2024-08-15 18:19:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-15 18:19:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-08-15 18:19:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-08-15 18:19:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-15 18:19:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-08-15 18:19:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-08-15 18:19:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-08-15 18:19:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-08-15 18:19:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-08-15 18:19:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-08-15 18:19:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-08-15 18:19:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-08-15 18:19:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-08-15 18:19:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-08-15 18:19:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-08-15 18:19:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:20,534 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-15 18:19:20,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500005931] [2024-08-15 18:19:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500005931] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:19:20,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:19:20,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-15 18:19:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537070778] [2024-08-15 18:19:20,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:19:20,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-15 18:19:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-15 18:19:20,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-15 18:19:20,537 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-15 18:19:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:20,612 INFO L93 Difference]: Finished difference Result 3691 states and 5189 transitions. [2024-08-15 18:19:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-15 18:19:20,613 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-15 18:19:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:20,626 INFO L225 Difference]: With dead ends: 3691 [2024-08-15 18:19:20,627 INFO L226 Difference]: Without dead ends: 3691 [2024-08-15 18:19:20,627 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-15 18:19:20,628 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.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:20,628 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.1s Time] [2024-08-15 18:19:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2024-08-15 18:19:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3691. [2024-08-15 18:19:20,699 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-15 18:19:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 5189 transitions. [2024-08-15 18:19:20,719 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 5189 transitions. Word has length 380 [2024-08-15 18:19:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:20,719 INFO L495 AbstractCegarLoop]: Abstraction has 3691 states and 5189 transitions. [2024-08-15 18:19:20,720 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-15 18:19:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 5189 transitions. [2024-08-15 18:19:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-08-15 18:19:20,730 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:20,730 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-15 18:19:20,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-15 18:19:20,731 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:20,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2008007972, now seen corresponding path program 2 times [2024-08-15 18:19:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:20,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683045219] [2024-08-15 18:19:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:20,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-15 18:19:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-08-15 18:19:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-08-15 18:19:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-08-15 18:19:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-08-15 18:19:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-08-15 18:19:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-08-15 18:19:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-08-15 18:19:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-08-15 18:19:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-08-15 18:19:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-08-15 18:19:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-08-15 18:19:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-08-15 18:19:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-08-15 18:19:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-08-15 18:19:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:22,184 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-15 18:19:22,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683045219] [2024-08-15 18:19:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683045219] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:19:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498898437] [2024-08-15 18:19:22,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-15 18:19:22,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:22,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:22,187 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-15 18:19:22,188 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-15 18:19:22,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-15 18:19:22,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-15 18:19:23,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 2143 conjuncts, 20 conjunts are in the unsatisfiable core [2024-08-15 18:19:23,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:19:23,224 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-15 18:19:23,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:19:23,415 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-15 18:19:23,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498898437] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:19:23,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:19:23,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-08-15 18:19:23,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192696023] [2024-08-15 18:19:23,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:19:23,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-15 18:19:23,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:23,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-15 18:19:23,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-08-15 18:19:23,418 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-15 18:19:23,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:23,580 INFO L93 Difference]: Finished difference Result 3422 states and 4807 transitions. [2024-08-15 18:19:23,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-15 18:19:23,581 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-15 18:19:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:23,592 INFO L225 Difference]: With dead ends: 3422 [2024-08-15 18:19:23,593 INFO L226 Difference]: Without dead ends: 3422 [2024-08-15 18:19:23,593 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-15 18:19:23,594 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 102 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:23,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 356 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:19:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2024-08-15 18:19:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3422. [2024-08-15 18:19:23,650 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-15 18:19:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4807 transitions. [2024-08-15 18:19:23,665 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4807 transitions. Word has length 381 [2024-08-15 18:19:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:23,666 INFO L495 AbstractCegarLoop]: Abstraction has 3422 states and 4807 transitions. [2024-08-15 18:19:23,666 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-15 18:19:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4807 transitions. [2024-08-15 18:19:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-08-15 18:19:23,675 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:23,675 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-15 18:19:23,702 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-15 18:19:23,875 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-15 18:19:23,876 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:23,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1116080477, now seen corresponding path program 3 times [2024-08-15 18:19:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:23,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422665297] [2024-08-15 18:19:23,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-08-15 18:19:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-08-15 18:19:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-08-15 18:19:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-08-15 18:19:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-08-15 18:19:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-08-15 18:19:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-08-15 18:19:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-08-15 18:19:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-08-15 18:19:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-08-15 18:19:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-15 18:19:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-08-15 18:19:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-08-15 18:19:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-08-15 18:19:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-08-15 18:19:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:28,644 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-15 18:19:28,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:28,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422665297] [2024-08-15 18:19:28,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422665297] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:19:28,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126427176] [2024-08-15 18:19:28,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-15 18:19:28,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:28,649 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-15 18:19:28,652 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-15 18:19:29,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-08-15 18:19:29,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-15 18:19:29,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 86 conjunts are in the unsatisfiable core [2024-08-15 18:19:29,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:19:30,525 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-15 18:19:30,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:19:33,622 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-15 18:19:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126427176] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:19:33,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:19:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 16] total 44 [2024-08-15 18:19:33,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753428079] [2024-08-15 18:19:33,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:19:33,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-08-15 18:19:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-08-15 18:19:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1666, Unknown=0, NotChecked=0, Total=1892 [2024-08-15 18:19:33,626 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-15 18:19:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:37,477 INFO L93 Difference]: Finished difference Result 1235 states and 1688 transitions. [2024-08-15 18:19:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-08-15 18:19:37,478 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-15 18:19:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:37,482 INFO L225 Difference]: With dead ends: 1235 [2024-08-15 18:19:37,482 INFO L226 Difference]: Without dead ends: 1235 [2024-08-15 18:19:37,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 768 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2308 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1428, Invalid=7884, Unknown=0, NotChecked=0, Total=9312 [2024-08-15 18:19:37,486 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 449 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:37,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 632 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-08-15 18:19:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2024-08-15 18:19:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 619. [2024-08-15 18:19:37,501 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-15 18:19:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 824 transitions. [2024-08-15 18:19:37,503 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 824 transitions. Word has length 381 [2024-08-15 18:19:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:37,503 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 824 transitions. [2024-08-15 18:19:37,503 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-15 18:19:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 824 transitions. [2024-08-15 18:19:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-08-15 18:19:37,506 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:37,506 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-15 18:19:37,529 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-15 18:19:37,707 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-15 18:19:37,707 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:37,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2044656794, now seen corresponding path program 1 times [2024-08-15 18:19:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:37,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045515547] [2024-08-15 18:19:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:37,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:19:39,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:19:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:19:41,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-15 18:19:41,263 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:19:41,264 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:19:41,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-15 18:19:41,273 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2024-08-15 18:19:41,277 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:19:41,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:19:41 BoogieIcfgContainer [2024-08-15 18:19:41,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:19:41,418 INFO L158 Benchmark]: Toolchain (without parser) took 59113.52ms. Allocated memory was 184.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 109.6MB in the beginning and 579.9MB in the end (delta: -470.3MB). Peak memory consumption was 629.3MB. Max. memory is 16.1GB. [2024-08-15 18:19:41,418 INFO L158 Benchmark]: Witness Parser took 0.48ms. Allocated memory is still 113.2MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:19:41,418 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 156.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:19:41,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.96ms. Allocated memory is still 184.5MB. Free memory was 109.5MB in the beginning and 155.6MB in the end (delta: -46.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-08-15 18:19:41,418 INFO L158 Benchmark]: Boogie Preprocessor took 95.74ms. Allocated memory is still 184.5MB. Free memory was 155.6MB in the beginning and 153.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-15 18:19:41,419 INFO L158 Benchmark]: IcfgBuilder took 697.79ms. Allocated memory is still 184.5MB. Free memory was 152.8MB in the beginning and 123.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-08-15 18:19:41,419 INFO L158 Benchmark]: TraceAbstraction took 57985.55ms. Allocated memory was 184.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 122.7MB in the beginning and 579.9MB in the end (delta: -457.2MB). Peak memory consumption was 643.8MB. Max. memory is 16.1GB. [2024-08-15 18:19:41,420 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.48ms. Allocated memory is still 113.2MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 156.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.96ms. Allocated memory is still 184.5MB. Free memory was 109.5MB in the beginning and 155.6MB in the end (delta: -46.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.74ms. Allocated memory is still 184.5MB. Free memory was 155.6MB in the beginning and 153.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 697.79ms. Allocated memory is still 184.5MB. Free memory was 152.8MB in the beginning and 123.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 57985.55ms. Allocated memory was 184.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 122.7MB in the beginning and 579.9MB in the end (delta: -457.2MB). Peak memory consumption was 643.8MB. 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: 57.8s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1367 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1360 mSDsluCounter, 7316 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6506 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5918 IncrementalHoareTripleChecker+Invalid, 5972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 810 mSDtfsCounter, 5918 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5966 GetRequests, 5674 SyntacticMatches, 2 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3805 ImplicationChecksByTransitivity, 5.4s 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.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 2779 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 10.3s SatisfiabilityAnalysisTime, 30.2s 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-15 18:19:41,477 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-03fe66f-m [2024-08-15 18:19:43,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:19:44,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-15 18:19:44,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:19:44,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:19:44,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:19:44,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:19:44,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:19:44,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:19:44,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:19:44,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:19:44,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:19:44,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:19:44,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:19:44,073 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:19:44,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:19:44,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:19:44,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:19:44,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:19:44,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:19:44,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:19:44,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-15 18:19:44,078 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-15 18:19:44,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:19:44,078 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-15 18:19:44,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:19:44,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:19:44,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:19:44,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:19:44,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:19:44,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:19:44,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:19:44,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:19:44,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:19:44,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:19:44,082 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-15 18:19:44,082 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-15 18:19:44,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:19:44,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:19:44,083 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:19:44,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:19:44,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:19:44,084 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-15 18:19:44,084 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-15 18:19:44,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:19:44,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:19:44,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:19:44,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:19:44,459 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:19:44,460 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-15 18:19:46,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:19:46,371 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:19:46,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-08-15 18:19:46,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800afadb7/1cee8dedcd0d4d38a5c03394939fa8ec/FLAG4fb113b4c [2024-08-15 18:19:46,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800afadb7/1cee8dedcd0d4d38a5c03394939fa8ec [2024-08-15 18:19:46,411 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:19:46,412 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:19:46,414 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-15 18:19:46,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:19:46,538 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:19:46,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:19:46,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:19:46,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:19:46,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:19:46" (1/2) ... [2024-08-15 18:19:46,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b28afdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:46, skipping insertion in model container [2024-08-15 18:19:46,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:19:46" (1/2) ... [2024-08-15 18:19:46,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@21524865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:46, skipping insertion in model container [2024-08-15 18:19:46,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:19:46" (2/2) ... [2024-08-15 18:19:46,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b28afdc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46, skipping insertion in model container [2024-08-15 18:19:46,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:19:46" (2/2) ... [2024-08-15 18:19:46,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:19:46,746 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-15 18:19:46,807 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:19:46,825 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:19:46,840 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-15 18:19:46,859 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:19:46,881 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:19:46,882 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46 WrapperNode [2024-08-15 18:19:46,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:19:46,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:19:46,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:19:46,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:19:46,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46" (1/1) ... [2024-08-15 18:19:46,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46" (1/1) ... [2024-08-15 18:19:46,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46" (1/1) ... [2024-08-15 18:19:46,934 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-15 18:19:46,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46" (1/1) ... [2024-08-15 18:19:46,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46" (1/1) ... [2024-08-15 18:19:46,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46" (1/1) ... [2024-08-15 18:19:46,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46" (1/1) ... [2024-08-15 18:19:46,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46" (1/1) ... [2024-08-15 18:19:46,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:19:46,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:19:46,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:19:46,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:19:46,965 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46" (1/1) ... [2024-08-15 18:19:46,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:19:46,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:47,006 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-15 18:19:47,013 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-15 18:19:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:19:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:19:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:19:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:19:47,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:19:47,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:19:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:19:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:19:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:19:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:19:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:19:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:19:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:19:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:19:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:19:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:19:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:19:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:19:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-15 18:19:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:19:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-15 18:19:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-15 18:19:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:19:47,151 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:19:47,154 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:19:47,452 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-08-15 18:19:47,453 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:19:47,463 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:19:47,464 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:19:47,465 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:19:47 BoogieIcfgContainer [2024-08-15 18:19:47,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:19:47,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:19:47,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:19:47,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:19:47,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:19:46" (1/4) ... [2024-08-15 18:19:47,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664fca88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:19:47, skipping insertion in model container [2024-08-15 18:19:47,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:19:46" (2/4) ... [2024-08-15 18:19:47,475 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:19:47,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664fca88 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:19:47, skipping insertion in model container [2024-08-15 18:19:47,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:46" (3/4) ... [2024-08-15 18:19:47,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664fca88 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:19:47, skipping insertion in model container [2024-08-15 18:19:47,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:19:47" (4/4) ... [2024-08-15 18:19:47,479 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-08-15 18:19:47,498 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:19:47,498 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:19:47,550 INFO L90 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [48] [2024-08-15 18:19:47,648 INFO L95 WitnessUtils]: Product has 416 reachable states. [2024-08-15 18:19:47,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:19:47,678 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;@2c5cf676, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:19:47,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:19:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 467 transitions. [2024-08-15 18:19:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-08-15 18:19:47,703 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:47,704 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:19:47,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:47,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:47,710 INFO L85 PathProgramCache]: Analyzing trace with hash 84472225, now seen corresponding path program 1 times [2024-08-15 18:19:47,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-15 18:19:47,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976013070] [2024-08-15 18:19:47,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:47,729 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-15 18:19:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-15 18:19:47,732 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-15 18:19:47,734 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-15 18:19:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:19:48,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:19:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:19:48,621 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-15 18:19:48,623 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:19:48,624 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:19:48,637 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-08-15 18:19:48,826 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-15 18:19:48,833 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-15 18:19:48,838 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:19:48,933 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:19:48 BoogieIcfgContainer [2024-08-15 18:19:48,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:19:48,935 INFO L158 Benchmark]: Toolchain (without parser) took 2397.31ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 34.3MB in the beginning and 46.2MB in the end (delta: -11.9MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-08-15 18:19:48,936 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 41.9MB. Free memory was 17.9MB in the beginning and 17.9MB in the end (delta: 32.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:19:48,936 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 62.9MB. Free memory is still 37.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:19:48,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.47ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 34.0MB in the beginning and 53.3MB in the end (delta: -19.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-08-15 18:19:48,937 INFO L158 Benchmark]: Boogie Preprocessor took 74.96ms. Allocated memory is still 77.6MB. Free memory was 53.3MB in the beginning and 50.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-15 18:19:48,937 INFO L158 Benchmark]: IcfgBuilder took 501.94ms. Allocated memory is still 77.6MB. Free memory was 50.7MB in the beginning and 33.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-08-15 18:19:48,938 INFO L158 Benchmark]: TraceAbstraction took 1466.38ms. Allocated memory is still 77.6MB. Free memory was 33.2MB in the beginning and 46.2MB in the end (delta: -13.0MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-08-15 18:19:48,940 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.18ms. Allocated memory is still 41.9MB. Free memory was 17.9MB in the beginning and 17.9MB in the end (delta: 32.2kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 62.9MB. Free memory is still 37.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.47ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 34.0MB in the beginning and 53.3MB in the end (delta: -19.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.96ms. Allocated memory is still 77.6MB. Free memory was 53.3MB in the beginning and 50.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 501.94ms. Allocated memory is still 77.6MB. Free memory was 50.7MB in the beginning and 33.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1466.38ms. Allocated memory is still 77.6MB. Free memory was 33.2MB in the beginning and 46.2MB in the end (delta: -13.0MB). Peak memory consumption was 9.2MB. 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=416occurred 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-15 18:19:48,991 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