./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.synabs2.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26998269 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.synabs2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:26:24,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:26:24,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-14 14:26:24,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:26:24,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:26:24,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:26:24,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:26:24,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:26:24,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:26:24,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:26:24,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:26:24,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:26:24,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:26:24,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:26:24,457 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:26:24,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:26:24,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:26:24,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:26:24,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:26:24,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:26:24,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:26:24,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:26:24,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:26:24,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:26:24,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:26:24,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:26:24,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:26:24,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:26:24,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:26:24,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:26:24,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:26:24,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:26:24,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:26:24,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:26:24,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:26:24,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:26:24,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:26:24,465 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:26:24,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:26:24,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:26:24,465 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:26:24,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:26:24,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:26:24,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:26:24,775 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:26:24,776 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:26:24,777 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.synabs2.yml/witness.yml [2024-08-14 14:26:24,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:26:24,896 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:26:24,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-08-14 14:26:26,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:26:26,578 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:26:26,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-08-14 14:26:26,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190198504/bff9e245e71d4d319f05ec32327e5c93/FLAG84d7aaa30 [2024-08-14 14:26:26,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190198504/bff9e245e71d4d319f05ec32327e5c93 [2024-08-14 14:26:26,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:26:26,955 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:26:26,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:26:26,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:26:26,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:26:26,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:24" (1/2) ... [2024-08-14 14:26:26,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bf111a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:26, skipping insertion in model container [2024-08-14 14:26:26,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:24" (1/2) ... [2024-08-14 14:26:26,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1c6be3df and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:26, skipping insertion in model container [2024-08-14 14:26:26,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:26:26" (2/2) ... [2024-08-14 14:26:26,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bf111a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:26, skipping insertion in model container [2024-08-14 14:26:26,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:26:26" (2/2) ... [2024-08-14 14:26:26,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:26:27,164 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.synabs2.c[1247,1260] [2024-08-14 14:26:27,208 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:26:27,225 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:26:27,238 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.synabs2.c[1247,1260] [2024-08-14 14:26:27,260 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:26:27,282 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:26:27,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27 WrapperNode [2024-08-14 14:26:27,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:26:27,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:26:27,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:26:27,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:26:27,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27" (1/1) ... [2024-08-14 14:26:27,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27" (1/1) ... [2024-08-14 14:26:27,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27" (1/1) ... [2024-08-14 14:26:27,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:26:27,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27" (1/1) ... [2024-08-14 14:26:27,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27" (1/1) ... [2024-08-14 14:26:27,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27" (1/1) ... [2024-08-14 14:26:27,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27" (1/1) ... [2024-08-14 14:26:27,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27" (1/1) ... [2024-08-14 14:26:27,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:26:27,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:26:27,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:26:27,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:26:27,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27" (1/1) ... [2024-08-14 14:26:27,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:26:27,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:27,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:26:27,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:26:27,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:26:27,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:26:27,456 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:26:27,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:26:27,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:26:27,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:26:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:26:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:26:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:26:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:26:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:26:27,458 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:26:27,459 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:26:27,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:26:27,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:26:27,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:26:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:26:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:26:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:26:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:26:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:26:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:26:27,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:26:27,558 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:26:27,560 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:26:27,937 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-08-14 14:26:27,938 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:26:27,947 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:26:27,948 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:26:27,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:26:27 BoogieIcfgContainer [2024-08-14 14:26:27,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:26:27,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:26:27,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:26:27,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:26:27,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:24" (1/4) ... [2024-08-14 14:26:27,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86b66b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:26:27, skipping insertion in model container [2024-08-14 14:26:27,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:26:26" (2/4) ... [2024-08-14 14:26:27,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86b66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:26:27, skipping insertion in model container [2024-08-14 14:26:27,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:27" (3/4) ... [2024-08-14 14:26:27,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86b66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:26:27, skipping insertion in model container [2024-08-14 14:26:27,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:26:27" (4/4) ... [2024-08-14 14:26:27,962 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2024-08-14 14:26:27,962 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:26:27,983 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:26:27,983 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:26:28,016 INFO L92 WitnessUtils]: Constructing product of automaton with 45 states and violation witness of the following lengths: [42] [2024-08-14 14:26:28,021 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 45 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:28,264 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 882 states to 724 states. [2024-08-14 14:26:28,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:26:28,297 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;@1a72c593, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:26:28,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:26:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states. [2024-08-14 14:26:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-08-14 14:26:28,325 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:28,326 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:28,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:28,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash 585286487, now seen corresponding path program 1 times [2024-08-14 14:26:28,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:28,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865699965] [2024-08-14 14:26:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:28,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:26:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-08-14 14:26:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-08-14 14:26:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-08-14 14:26:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:26:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-08-14 14:26:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-08-14 14:26:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-08-14 14:26:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-08-14 14:26:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-08-14 14:26:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-08-14 14:26:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-08-14 14:26:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-08-14 14:26:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1534 trivial. 0 not checked. [2024-08-14 14:26:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865699965] [2024-08-14 14:26:30,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865699965] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:30,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:30,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:26:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118692464] [2024-08-14 14:26:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:30,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:26:30,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:30,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:26:30,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:26:30,175 INFO L87 Difference]: Start difference. First operand 724 states. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:30,272 INFO L93 Difference]: Finished difference Result 653 states and 943 transitions. [2024-08-14 14:26:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:26:30,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 266 [2024-08-14 14:26:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:30,287 INFO L225 Difference]: With dead ends: 653 [2024-08-14 14:26:30,289 INFO L226 Difference]: Without dead ends: 640 [2024-08-14 14:26:30,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:26:30,296 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 23 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:30,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 251 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:26:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-08-14 14:26:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 351. [2024-08-14 14:26:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 319 states have (on average 1.5172413793103448) internal successors, (484), 320 states have internal predecessors, (484), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-08-14 14:26:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 515 transitions. [2024-08-14 14:26:30,377 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 515 transitions. Word has length 266 [2024-08-14 14:26:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:30,379 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 515 transitions. [2024-08-14 14:26:30,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 515 transitions. [2024-08-14 14:26:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-08-14 14:26:30,384 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:30,384 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:30,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:26:30,385 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:30,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:30,386 INFO L85 PathProgramCache]: Analyzing trace with hash -615742048, now seen corresponding path program 1 times [2024-08-14 14:26:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:30,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845494928] [2024-08-14 14:26:30,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:26:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-08-14 14:26:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-08-14 14:26:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-08-14 14:26:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:26:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-08-14 14:26:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-08-14 14:26:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-08-14 14:26:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-08-14 14:26:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-08-14 14:26:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-08-14 14:26:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-08-14 14:26:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-08-14 14:26:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-08-14 14:26:31,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:31,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845494928] [2024-08-14 14:26:31,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845494928] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:31,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:31,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:26:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682195728] [2024-08-14 14:26:31,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:31,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:26:31,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:31,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:26:31,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:26:31,139 INFO L87 Difference]: Start difference. First operand 351 states and 515 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:31,160 INFO L93 Difference]: Finished difference Result 379 states and 543 transitions. [2024-08-14 14:26:31,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:26:31,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 267 [2024-08-14 14:26:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:31,163 INFO L225 Difference]: With dead ends: 379 [2024-08-14 14:26:31,163 INFO L226 Difference]: Without dead ends: 379 [2024-08-14 14:26:31,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:26:31,165 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:31,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:26:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-08-14 14:26:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2024-08-14 14:26:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 345 states have (on average 1.4782608695652173) internal successors, (510), 346 states have internal predecessors, (510), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-08-14 14:26:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 541 transitions. [2024-08-14 14:26:31,187 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 541 transitions. Word has length 267 [2024-08-14 14:26:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:31,188 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 541 transitions. [2024-08-14 14:26:31,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 541 transitions. [2024-08-14 14:26:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-08-14 14:26:31,191 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:31,191 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:31,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:26:31,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:31,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash 865399859, now seen corresponding path program 1 times [2024-08-14 14:26:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:31,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187894973] [2024-08-14 14:26:31,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:31,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:26:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-08-14 14:26:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-08-14 14:26:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-08-14 14:26:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:26:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-08-14 14:26:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-08-14 14:26:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-08-14 14:26:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-08-14 14:26:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-08-14 14:26:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-08-14 14:26:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-08-14 14:26:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-08-14 14:26:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-08-14 14:26:32,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187894973] [2024-08-14 14:26:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187894973] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:32,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:32,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 14:26:32,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436182196] [2024-08-14 14:26:32,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:32,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:26:32,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:26:32,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:26:32,104 INFO L87 Difference]: Start difference. First operand 377 states and 541 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:32,205 INFO L93 Difference]: Finished difference Result 377 states and 540 transitions. [2024-08-14 14:26:32,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:26:32,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 268 [2024-08-14 14:26:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:32,208 INFO L225 Difference]: With dead ends: 377 [2024-08-14 14:26:32,208 INFO L226 Difference]: Without dead ends: 377 [2024-08-14 14:26:32,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:26:32,210 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:32,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 109 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:26:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-08-14 14:26:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-08-14 14:26:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 345 states have (on average 1.4753623188405798) internal successors, (509), 346 states have internal predecessors, (509), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-08-14 14:26:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 540 transitions. [2024-08-14 14:26:32,234 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 540 transitions. Word has length 268 [2024-08-14 14:26:32,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:32,235 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 540 transitions. [2024-08-14 14:26:32,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 540 transitions. [2024-08-14 14:26:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-08-14 14:26:32,239 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:32,240 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:32,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 14:26:32,240 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:32,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1835332958, now seen corresponding path program 1 times [2024-08-14 14:26:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405472212] [2024-08-14 14:26:32,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:32,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:26:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-08-14 14:26:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-08-14 14:26:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-08-14 14:26:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-08-14 14:26:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-08-14 14:26:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-08-14 14:26:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-08-14 14:26:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-08-14 14:26:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-08-14 14:26:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-08-14 14:26:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-08-14 14:26:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-08-14 14:26:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-08-14 14:26:33,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:33,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405472212] [2024-08-14 14:26:33,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405472212] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:33,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:33,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 14:26:33,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058872208] [2024-08-14 14:26:33,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:33,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:26:33,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:33,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:26:33,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:26:33,120 INFO L87 Difference]: Start difference. First operand 377 states and 540 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:33,220 INFO L93 Difference]: Finished difference Result 377 states and 539 transitions. [2024-08-14 14:26:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:26:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 269 [2024-08-14 14:26:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:33,222 INFO L225 Difference]: With dead ends: 377 [2024-08-14 14:26:33,223 INFO L226 Difference]: Without dead ends: 377 [2024-08-14 14:26:33,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:26:33,224 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:33,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 110 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:26:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-08-14 14:26:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-08-14 14:26:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 345 states have (on average 1.472463768115942) internal successors, (508), 346 states have internal predecessors, (508), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-08-14 14:26:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 539 transitions. [2024-08-14 14:26:33,232 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 539 transitions. Word has length 269 [2024-08-14 14:26:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:33,233 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 539 transitions. [2024-08-14 14:26:33,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 539 transitions. [2024-08-14 14:26:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-08-14 14:26:33,236 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:33,236 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:33,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-14 14:26:33,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:33,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:33,237 INFO L85 PathProgramCache]: Analyzing trace with hash 998538015, now seen corresponding path program 1 times [2024-08-14 14:26:33,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:33,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334478972] [2024-08-14 14:26:33,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:33,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:26:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-08-14 14:26:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-08-14 14:26:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-08-14 14:26:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-08-14 14:26:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-08-14 14:26:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-08-14 14:26:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-08-14 14:26:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-08-14 14:26:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-08-14 14:26:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-08-14 14:26:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-08-14 14:26:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-08-14 14:26:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1534 trivial. 0 not checked. [2024-08-14 14:26:34,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334478972] [2024-08-14 14:26:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334478972] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:26:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337353035] [2024-08-14 14:26:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:34,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:26:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:34,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:26:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:26:34,151 INFO L87 Difference]: Start difference. First operand 377 states and 539 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:26:34,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:34,189 INFO L93 Difference]: Finished difference Result 351 states and 485 transitions. [2024-08-14 14:26:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:26:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 269 [2024-08-14 14:26:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:34,192 INFO L225 Difference]: With dead ends: 351 [2024-08-14 14:26:34,193 INFO L226 Difference]: Without dead ends: 351 [2024-08-14 14:26:34,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:26:34,194 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:34,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 110 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:26:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-08-14 14:26:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-08-14 14:26:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 319 states have (on average 1.4231974921630095) internal successors, (454), 320 states have internal predecessors, (454), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-08-14 14:26:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 485 transitions. [2024-08-14 14:26:34,203 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 485 transitions. Word has length 269 [2024-08-14 14:26:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:34,203 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 485 transitions. [2024-08-14 14:26:34,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:26:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 485 transitions. [2024-08-14 14:26:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-08-14 14:26:34,207 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:34,207 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:34,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 14:26:34,207 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:34,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash -414527660, now seen corresponding path program 1 times [2024-08-14 14:26:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:34,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237890231] [2024-08-14 14:26:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:34,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-08-14 14:26:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:26:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-08-14 14:26:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-08-14 14:26:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-14 14:26:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:26:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-08-14 14:26:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-08-14 14:26:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-08-14 14:26:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-08-14 14:26:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-08-14 14:26:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-08-14 14:26:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-08-14 14:26:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 781 proven. 8 refuted. 0 times theorem prover too weak. 888 trivial. 0 not checked. [2024-08-14 14:26:35,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:35,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237890231] [2024-08-14 14:26:35,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237890231] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:35,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825547843] [2024-08-14 14:26:35,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:35,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:35,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:35,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:35,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-14 14:26:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 20 conjunts are in the unsatisfiable core [2024-08-14 14:26:35,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2024-08-14 14:26:35,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:26:35,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825547843] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:35,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:26:35,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2024-08-14 14:26:35,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732002798] [2024-08-14 14:26:35,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:35,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:26:35,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:26:35,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-08-14 14:26:35,817 INFO L87 Difference]: Start difference. First operand 351 states and 485 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:35,931 INFO L93 Difference]: Finished difference Result 592 states and 787 transitions. [2024-08-14 14:26:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:26:35,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 282 [2024-08-14 14:26:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:35,934 INFO L225 Difference]: With dead ends: 592 [2024-08-14 14:26:35,934 INFO L226 Difference]: Without dead ends: 590 [2024-08-14 14:26:35,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:26:35,935 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:35,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 208 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:26:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-08-14 14:26:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 577. [2024-08-14 14:26:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 533 states have (on average 1.320825515947467) internal successors, (704), 535 states have internal predecessors, (704), 28 states have call successors, (28), 16 states have call predecessors, (28), 15 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-08-14 14:26:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 759 transitions. [2024-08-14 14:26:35,948 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 759 transitions. Word has length 282 [2024-08-14 14:26:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:35,948 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 759 transitions. [2024-08-14 14:26:35,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 759 transitions. [2024-08-14 14:26:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-08-14 14:26:35,952 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:35,952 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:35,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-08-14 14:26:36,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-08-14 14:26:36,153 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:36,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1573614404, now seen corresponding path program 1 times [2024-08-14 14:26:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:36,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180819998] [2024-08-14 14:26:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-08-14 14:26:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:26:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:26:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-08-14 14:26:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-08-14 14:26:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-14 14:26:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-08-14 14:26:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-08-14 14:26:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-08-14 14:26:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-08-14 14:26:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-08-14 14:26:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-08-14 14:26:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-14 14:26:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2024-08-14 14:26:36,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:36,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180819998] [2024-08-14 14:26:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180819998] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 14:26:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72412785] [2024-08-14 14:26:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:36,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:26:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:36,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:26:36,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:26:36,955 INFO L87 Difference]: Start difference. First operand 577 states and 759 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-08-14 14:26:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:37,125 INFO L93 Difference]: Finished difference Result 808 states and 1091 transitions. [2024-08-14 14:26:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:26:37,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 283 [2024-08-14 14:26:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:37,129 INFO L225 Difference]: With dead ends: 808 [2024-08-14 14:26:37,129 INFO L226 Difference]: Without dead ends: 808 [2024-08-14 14:26:37,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:26:37,130 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:37,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 215 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:26:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-08-14 14:26:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 796. [2024-08-14 14:26:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 739 states have (on average 1.334235453315291) internal successors, (986), 742 states have internal predecessors, (986), 41 states have call successors, (41), 16 states have call predecessors, (41), 15 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-08-14 14:26:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1067 transitions. [2024-08-14 14:26:37,146 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1067 transitions. Word has length 283 [2024-08-14 14:26:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:37,146 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1067 transitions. [2024-08-14 14:26:37,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-08-14 14:26:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1067 transitions. [2024-08-14 14:26:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-08-14 14:26:37,150 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:37,150 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:37,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 14:26:37,151 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:37,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2062970013, now seen corresponding path program 1 times [2024-08-14 14:26:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846284882] [2024-08-14 14:26:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-08-14 14:26:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:26:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:26:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-08-14 14:26:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-08-14 14:26:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-14 14:26:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-08-14 14:26:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-08-14 14:26:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-08-14 14:26:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-08-14 14:26:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-08-14 14:26:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-08-14 14:26:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-14 14:26:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 660 proven. 3 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2024-08-14 14:26:38,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:38,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846284882] [2024-08-14 14:26:38,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846284882] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:38,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811967029] [2024-08-14 14:26:38,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:38,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:38,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:38,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:38,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-14 14:26:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 20 conjunts are in the unsatisfiable core [2024-08-14 14:26:38,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 889 proven. 4 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2024-08-14 14:26:39,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 741 proven. 8 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-08-14 14:26:39,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811967029] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:39,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:39,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-08-14 14:26:39,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599242235] [2024-08-14 14:26:39,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:39,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-14 14:26:39,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:39,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-14 14:26:39,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:26:39,526 INFO L87 Difference]: Start difference. First operand 796 states and 1067 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-08-14 14:26:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:39,640 INFO L93 Difference]: Finished difference Result 716 states and 963 transitions. [2024-08-14 14:26:39,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:26:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 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 283 [2024-08-14 14:26:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:39,643 INFO L225 Difference]: With dead ends: 716 [2024-08-14 14:26:39,643 INFO L226 Difference]: Without dead ends: 668 [2024-08-14 14:26:39,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 589 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:26:39,646 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 40 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:39,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 87 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:26:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-08-14 14:26:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 644. [2024-08-14 14:26:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 599 states have (on average 1.352253756260434) internal successors, (810), 601 states have internal predecessors, (810), 29 states have call successors, (29), 16 states have call predecessors, (29), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-08-14 14:26:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 867 transitions. [2024-08-14 14:26:39,665 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 867 transitions. Word has length 283 [2024-08-14 14:26:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:39,665 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 867 transitions. [2024-08-14 14:26:39,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-08-14 14:26:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 867 transitions. [2024-08-14 14:26:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-08-14 14:26:39,670 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:39,670 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:39,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-08-14 14:26:39,874 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,SelfDestructingSolverStorable7 [2024-08-14 14:26:39,875 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:39,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:39,875 INFO L85 PathProgramCache]: Analyzing trace with hash -844428486, now seen corresponding path program 1 times [2024-08-14 14:26:39,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:39,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089217840] [2024-08-14 14:26:39,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:39,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-08-14 14:26:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:26:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-08-14 14:26:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-14 14:26:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-08-14 14:26:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-08-14 14:26:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-08-14 14:26:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-08-14 14:26:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-08-14 14:26:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-08-14 14:26:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-08-14 14:26:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-14 14:26:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-08-14 14:26:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 1382 trivial. 0 not checked. [2024-08-14 14:26:40,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:40,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089217840] [2024-08-14 14:26:40,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089217840] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:40,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:40,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:26:40,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524511487] [2024-08-14 14:26:40,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:40,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:26:40,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:40,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:26:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:26:40,741 INFO L87 Difference]: Start difference. First operand 644 states and 867 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-08-14 14:26:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:40,879 INFO L93 Difference]: Finished difference Result 1046 states and 1395 transitions. [2024-08-14 14:26:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:26:40,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 307 [2024-08-14 14:26:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:40,884 INFO L225 Difference]: With dead ends: 1046 [2024-08-14 14:26:40,884 INFO L226 Difference]: Without dead ends: 1046 [2024-08-14 14:26:40,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:26:40,885 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 42 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:40,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 125 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:26:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-08-14 14:26:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2024-08-14 14:26:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 975 states have (on average 1.318974358974359) internal successors, (1286), 979 states have internal predecessors, (1286), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2024-08-14 14:26:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1395 transitions. [2024-08-14 14:26:40,910 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1395 transitions. Word has length 307 [2024-08-14 14:26:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:40,911 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 1395 transitions. [2024-08-14 14:26:40,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-08-14 14:26:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1395 transitions. [2024-08-14 14:26:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-08-14 14:26:40,917 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:40,918 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:40,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-14 14:26:40,918 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:40,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash 882522828, now seen corresponding path program 1 times [2024-08-14 14:26:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:40,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187233503] [2024-08-14 14:26:40,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-08-14 14:26:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:26:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-08-14 14:26:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-14 14:26:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-08-14 14:26:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-08-14 14:26:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-08-14 14:26:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-08-14 14:26:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-08-14 14:26:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-08-14 14:26:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-08-14 14:26:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-14 14:26:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-08-14 14:26:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1749 backedges. 773 proven. 14 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2024-08-14 14:26:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:41,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187233503] [2024-08-14 14:26:41,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187233503] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:41,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264028084] [2024-08-14 14:26:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:41,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:41,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:41,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:42,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-14 14:26:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:42,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 62 conjunts are in the unsatisfiable core [2024-08-14 14:26:42,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1749 backedges. 434 proven. 2 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2024-08-14 14:26:42,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1749 backedges. 490 proven. 40 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2024-08-14 14:26:43,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264028084] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:43,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:43,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 15] total 28 [2024-08-14 14:26:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106867672] [2024-08-14 14:26:43,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:43,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-08-14 14:26:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-08-14 14:26:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2024-08-14 14:26:43,476 INFO L87 Difference]: Start difference. First operand 1046 states and 1395 transitions. Second operand has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-08-14 14:26:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:44,243 INFO L93 Difference]: Finished difference Result 1146 states and 1470 transitions. [2024-08-14 14:26:44,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 14:26:44,243 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 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 307 [2024-08-14 14:26:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:44,247 INFO L225 Difference]: With dead ends: 1146 [2024-08-14 14:26:44,248 INFO L226 Difference]: Without dead ends: 1146 [2024-08-14 14:26:44,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=335, Invalid=1471, Unknown=0, NotChecked=0, Total=1806 [2024-08-14 14:26:44,249 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:44,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 438 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:26:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-08-14 14:26:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1071. [2024-08-14 14:26:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1000 states have (on average 1.286) internal successors, (1286), 1004 states have internal predecessors, (1286), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2024-08-14 14:26:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1395 transitions. [2024-08-14 14:26:44,269 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1395 transitions. Word has length 307 [2024-08-14 14:26:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:44,270 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1395 transitions. [2024-08-14 14:26:44,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-08-14 14:26:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1395 transitions. [2024-08-14 14:26:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-08-14 14:26:44,273 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:44,273 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:44,293 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-14 14:26:44,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:44,474 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:44,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1516376205, now seen corresponding path program 1 times [2024-08-14 14:26:44,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:44,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145043362] [2024-08-14 14:26:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-08-14 14:26:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:26:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-08-14 14:26:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-14 14:26:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-08-14 14:26:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-08-14 14:26:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-08-14 14:26:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-08-14 14:26:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-08-14 14:26:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-08-14 14:26:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-08-14 14:26:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-14 14:26:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-08-14 14:26:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 416 proven. 1 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2024-08-14 14:26:45,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:45,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145043362] [2024-08-14 14:26:45,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145043362] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:45,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216702901] [2024-08-14 14:26:45,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:45,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:45,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:45,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:45,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-14 14:26:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:45,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 34 conjunts are in the unsatisfiable core [2024-08-14 14:26:45,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 696 proven. 2 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2024-08-14 14:26:46,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 575 proven. 34 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2024-08-14 14:26:46,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216702901] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:46,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:46,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 17 [2024-08-14 14:26:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545385019] [2024-08-14 14:26:46,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:46,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-14 14:26:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:46,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-14 14:26:46,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-08-14 14:26:46,632 INFO L87 Difference]: Start difference. First operand 1071 states and 1395 transitions. Second operand has 17 states, 17 states have (on average 7.647058823529412) internal successors, (130), 17 states have internal predecessors, (130), 7 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-08-14 14:26:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:46,995 INFO L93 Difference]: Finished difference Result 1191 states and 1489 transitions. [2024-08-14 14:26:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 14:26:46,998 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.647058823529412) internal successors, (130), 17 states have internal predecessors, (130), 7 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 307 [2024-08-14 14:26:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:47,003 INFO L225 Difference]: With dead ends: 1191 [2024-08-14 14:26:47,003 INFO L226 Difference]: Without dead ends: 1191 [2024-08-14 14:26:47,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-08-14 14:26:47,004 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 38 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:47,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 332 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:26:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-08-14 14:26:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1119. [2024-08-14 14:26:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1048 states have (on average 1.248091603053435) internal successors, (1308), 1052 states have internal predecessors, (1308), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2024-08-14 14:26:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1417 transitions. [2024-08-14 14:26:47,031 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1417 transitions. Word has length 307 [2024-08-14 14:26:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:47,031 INFO L495 AbstractCegarLoop]: Abstraction has 1119 states and 1417 transitions. [2024-08-14 14:26:47,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.647058823529412) internal successors, (130), 17 states have internal predecessors, (130), 7 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-08-14 14:26:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1417 transitions. [2024-08-14 14:26:47,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-08-14 14:26:47,036 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:47,037 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:47,054 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-14 14:26:47,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:47,237 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:47,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:47,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1329529372, now seen corresponding path program 1 times [2024-08-14 14:26:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:47,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457032545] [2024-08-14 14:26:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-08-14 14:26:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-08-14 14:26:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-14 14:26:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-08-14 14:26:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-08-14 14:26:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-08-14 14:26:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-08-14 14:26:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-08-14 14:26:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-08-14 14:26:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-08-14 14:26:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-08-14 14:26:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-08-14 14:26:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-08-14 14:26:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 52 proven. 52 refuted. 0 times theorem prover too weak. 1729 trivial. 0 not checked. [2024-08-14 14:26:48,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:48,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457032545] [2024-08-14 14:26:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457032545] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:48,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354495636] [2024-08-14 14:26:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:48,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:48,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:48,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:49,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-14 14:26:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:49,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 37 conjunts are in the unsatisfiable core [2024-08-14 14:26:49,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 52 proven. 221 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2024-08-14 14:26:50,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 221 proven. 52 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2024-08-14 14:26:53,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354495636] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:53,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:53,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 21 [2024-08-14 14:26:53,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518483840] [2024-08-14 14:26:53,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:53,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-14 14:26:53,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:53,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-14 14:26:53,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-08-14 14:26:53,247 INFO L87 Difference]: Start difference. First operand 1119 states and 1417 transitions. Second operand has 21 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:26:53,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:53,452 INFO L93 Difference]: Finished difference Result 1119 states and 1364 transitions. [2024-08-14 14:26:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 14:26:53,457 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 308 [2024-08-14 14:26:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:53,463 INFO L225 Difference]: With dead ends: 1119 [2024-08-14 14:26:53,463 INFO L226 Difference]: Without dead ends: 1119 [2024-08-14 14:26:53,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2024-08-14 14:26:53,464 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 45 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:53,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 345 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:26:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-08-14 14:26:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2024-08-14 14:26:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1048 states have (on average 1.1975190839694656) internal successors, (1255), 1052 states have internal predecessors, (1255), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2024-08-14 14:26:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1364 transitions. [2024-08-14 14:26:53,488 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1364 transitions. Word has length 308 [2024-08-14 14:26:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:53,488 INFO L495 AbstractCegarLoop]: Abstraction has 1119 states and 1364 transitions. [2024-08-14 14:26:53,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:26:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1364 transitions. [2024-08-14 14:26:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-08-14 14:26:53,493 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:53,494 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:53,515 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-14 14:26:53,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-08-14 14:26:53,695 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:53,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1300900221, now seen corresponding path program 1 times [2024-08-14 14:26:53,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:53,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851628642] [2024-08-14 14:26:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:26:54,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:26:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:26:54,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:26:54,734 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:26:54,735 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:26:54,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-08-14 14:26:54,739 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:54,744 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:26:54,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:26:54 BoogieIcfgContainer [2024-08-14 14:26:54,869 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:26:54,869 INFO L158 Benchmark]: Toolchain (without parser) took 27916.89ms. Allocated memory was 174.1MB in the beginning and 828.4MB in the end (delta: 654.3MB). Free memory was 140.8MB in the beginning and 311.7MB in the end (delta: -171.0MB). Peak memory consumption was 485.4MB. Max. memory is 16.1GB. [2024-08-14 14:26:54,869 INFO L158 Benchmark]: Witness Parser took 0.59ms. Allocated memory is still 174.1MB. Free memory was 139.0MB in the beginning and 139.0MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:26:54,870 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:26:54,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.93ms. Allocated memory is still 174.1MB. Free memory was 140.8MB in the beginning and 127.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:26:54,870 INFO L158 Benchmark]: Boogie Preprocessor took 82.64ms. Allocated memory is still 174.1MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:26:54,870 INFO L158 Benchmark]: IcfgBuilder took 579.50ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 101.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-08-14 14:26:54,871 INFO L158 Benchmark]: TraceAbstraction took 26917.69ms. Allocated memory was 174.1MB in the beginning and 828.4MB in the end (delta: 654.3MB). Free memory was 101.2MB in the beginning and 311.7MB in the end (delta: -210.5MB). Peak memory consumption was 445.6MB. Max. memory is 16.1GB. [2024-08-14 14:26:54,872 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.59ms. Allocated memory is still 174.1MB. Free memory was 139.0MB in the beginning and 139.0MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.93ms. Allocated memory is still 174.1MB. Free memory was 140.8MB in the beginning and 127.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.64ms. Allocated memory is still 174.1MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 579.50ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 101.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 26917.69ms. Allocated memory was 174.1MB in the beginning and 828.4MB in the end (delta: 654.3MB). Free memory was 101.2MB in the beginning and 311.7MB in the end (delta: -210.5MB). Peak memory consumption was 445.6MB. 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 63. 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 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [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=31, var_14=1, var_21=2, var_5=0, var_8=6] [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=31, var_14=1, var_21=2, var_5=0, var_8=6] [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_16_arg_0=1, var_16_arg_1=-2, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_16_arg_0=1, var_16_arg_1=-2, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=6, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=6, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=6, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=6, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=6, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=6] [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=6] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_20_arg_0=0, var_21=2] [L69] EXPR var_20_arg_0 & mask_SORT_4 [L69] EXPR var_20_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2, var_23=2] [L76] EXPR var_23 & mask_SORT_4 [L76] EXPR var_23 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_9=0, var_14=1, var_21=2] [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_25_arg_0=0] [L79] EXPR var_25_arg_0 & mask_SORT_4 [L79] EXPR var_25_arg_0 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2, var_27=2] [L86] EXPR var_27 & mask_SORT_4 [L86] EXPR var_27 & mask_SORT_4 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, next_24_arg_1=0, var_14=1, var_21=2] [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-1, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_16=1, var_21=2] [L64] EXPR var_16 & mask_SORT_1 [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=1, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_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, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 2482 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1970 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1796 IncrementalHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 512 mSDtfsCounter, 1796 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3135 GetRequests, 3000 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1119occurred in iteration=11, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 487 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 5211 NumberOfCodeBlocks, 5211 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 6087 ConstructedInterpolants, 0 QuantifiedInterpolants, 24278 SizeOfPredicates, 15 NumberOfNonLiveVariables, 6746 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 21 InterpolantComputations, 8 PerfectInterpolantSequences, 35461/35902 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-08-14 14:26:54,914 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.synabs2.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.synabs2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:26:57,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:26:57,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-14 14:26:57,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:26:57,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:26:57,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:26:57,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:26:57,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:26:57,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:26:57,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:26:57,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:26:57,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:26:57,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:26:57,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:26:57,286 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:26:57,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:26:57,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:26:57,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:26:57,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:26:57,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:26:57,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:26:57,292 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:26:57,292 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:26:57,292 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:26:57,292 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:26:57,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:26:57,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:26:57,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:26:57,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:26:57,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:26:57,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:26:57,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:26:57,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:26:57,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:26:57,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:26:57,295 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:26:57,295 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:26:57,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:26:57,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:26:57,296 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:26:57,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:26:57,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:26:57,297 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:26:57,297 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:26:57,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:26:57,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:26:57,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:26:57,664 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:26:57,665 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:26:57,666 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.synabs2.yml/witness.yml [2024-08-14 14:26:57,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:26:57,777 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:26:57,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-08-14 14:26:59,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:26:59,505 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:26:59,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-08-14 14:26:59,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0edd788c8/51dc68a5eeae42f781c25a1934d9964e/FLAG29f523767 [2024-08-14 14:26:59,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0edd788c8/51dc68a5eeae42f781c25a1934d9964e [2024-08-14 14:26:59,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:26:59,541 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:26:59,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:26:59,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:26:59,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:26:59,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:57" (1/2) ... [2024-08-14 14:26:59,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa96ae and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:59, skipping insertion in model container [2024-08-14 14:26:59,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:57" (1/2) ... [2024-08-14 14:26:59,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@fa1d855 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:59, skipping insertion in model container [2024-08-14 14:26:59,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:26:59" (2/2) ... [2024-08-14 14:26:59,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa96ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59, skipping insertion in model container [2024-08-14 14:26:59,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:26:59" (2/2) ... [2024-08-14 14:26:59,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:26:59,760 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.synabs2.c[1247,1260] [2024-08-14 14:26:59,810 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:26:59,823 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:26:59,835 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.synabs2.c[1247,1260] [2024-08-14 14:26:59,862 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:26:59,882 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:26:59,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59 WrapperNode [2024-08-14 14:26:59,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:26:59,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:26:59,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:26:59,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:26:59,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59" (1/1) ... [2024-08-14 14:26:59,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59" (1/1) ... [2024-08-14 14:26:59,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59" (1/1) ... [2024-08-14 14:26:59,927 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:26:59,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59" (1/1) ... [2024-08-14 14:26:59,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59" (1/1) ... [2024-08-14 14:26:59,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59" (1/1) ... [2024-08-14 14:26:59,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59" (1/1) ... [2024-08-14 14:26:59,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59" (1/1) ... [2024-08-14 14:26:59,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:26:59,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:26:59,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:26:59,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:26:59,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59" (1/1) ... [2024-08-14 14:26:59,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:26:59,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:59,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:26:59,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:27:00,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:27:00,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:27:00,039 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:27:00,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:27:00,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:27:00,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:27:00,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:27:00,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:27:00,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:27:00,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:27:00,041 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:27:00,041 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:27:00,042 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:27:00,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:27:00,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:27:00,042 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:27:00,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:27:00,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:27:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:27:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:27:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:27:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:27:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:27:00,130 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:27:00,136 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:27:00,349 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-08-14 14:27:00,350 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:27:00,360 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:27:00,360 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:27:00,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:00 BoogieIcfgContainer [2024-08-14 14:27:00,360 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:27:00,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:27:00,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:27:00,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:27:00,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:57" (1/4) ... [2024-08-14 14:27:00,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464b3293 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:27:00, skipping insertion in model container [2024-08-14 14:27:00,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:26:59" (2/4) ... [2024-08-14 14:27:00,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464b3293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:00, skipping insertion in model container [2024-08-14 14:27:00,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:59" (3/4) ... [2024-08-14 14:27:00,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464b3293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:00, skipping insertion in model container [2024-08-14 14:27:00,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:00" (4/4) ... [2024-08-14 14:27:00,373 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2024-08-14 14:27:00,373 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:27:00,395 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:27:00,396 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:27:00,432 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [42] [2024-08-14 14:27:00,437 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:00,532 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 366 states to 208 states. [2024-08-14 14:27:00,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:27:00,556 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;@1e549fd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:27:00,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:27:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2024-08-14 14:27:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-08-14 14:27:00,571 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:00,572 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:00,573 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:00,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash 238118945, now seen corresponding path program 1 times [2024-08-14 14:27:00,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:27:00,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763460390] [2024-08-14 14:27:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:00,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:27:00,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:27:00,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-14 14:27:00,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-08-14 14:27:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:00,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:27:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:01,246 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:27:01,248 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:27:01,249 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:27:01,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-08-14 14:27:01,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:27:01,456 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:27:01,460 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:27:01,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:27:01 BoogieIcfgContainer [2024-08-14 14:27:01,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:27:01,523 INFO L158 Benchmark]: Toolchain (without parser) took 1982.05ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 30.2MB in the beginning and 57.1MB in the end (delta: -26.9MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-08-14 14:27:01,523 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 69.2MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:01,524 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 69.2MB. Free memory was 41.7MB in the beginning and 41.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:01,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.57ms. Allocated memory is still 69.2MB. Free memory was 30.0MB in the beginning and 38.7MB in the end (delta: -8.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-08-14 14:27:01,526 INFO L158 Benchmark]: Boogie Preprocessor took 62.02ms. Allocated memory is still 69.2MB. Free memory was 38.7MB in the beginning and 36.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:27:01,527 INFO L158 Benchmark]: IcfgBuilder took 411.78ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 36.4MB in the beginning and 74.8MB in the end (delta: -38.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:27:01,528 INFO L158 Benchmark]: TraceAbstraction took 1156.62ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 57.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-08-14 14:27:01,531 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.20ms. Allocated memory is still 69.2MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 69.2MB. Free memory was 41.7MB in the beginning and 41.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.57ms. Allocated memory is still 69.2MB. Free memory was 30.0MB in the beginning and 38.7MB in the end (delta: -8.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.02ms. Allocated memory is still 69.2MB. Free memory was 38.7MB in the beginning and 36.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 411.78ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 36.4MB in the beginning and 74.8MB in the end (delta: -38.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1156.62ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 57.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.5MB. 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 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [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_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=2, state_9=8, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=2, state_9=8, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=4, state_9=10, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=4, state_9=10, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=6, state_9=12, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=6, state_9=12, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=8, state_9=14, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=8, state_9=14, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=10, state_9=16, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=10, state_9=16, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=12, state_9=18, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=12, state_9=18, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=14, state_9=20, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=14, state_9=20, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=16, state_9=22, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=16, state_9=22, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=18, state_9=24, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=18, state_9=24, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=20, state_9=26, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=20, state_9=26, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=22, state_9=28, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=22, state_9=28, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=24, state_9=30, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_4=31, state_6=24, state_9=30, var_14=1, var_21=2] [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=1, mask_SORT_1=1, mask_SORT_4=31, state_6=26, state_9=0, var_14=1, var_21=2] [L66] CALL __VERIFIER_assert(!(bad_17_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.0s, OverallIterations: 1, TraceHistogramMax: 14, 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=208occurred 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-14 14:27:01,570 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