./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.v_non-pipelined-microprocessor.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.v_non-pipelined-microprocessor.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.v_non-pipelined-microprocessor.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:27:09,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:27:09,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-14 14:27:09,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:27:09,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:27:09,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:27:09,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:27:09,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:27:09,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:27:09,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:27:09,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:27:09,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:27:09,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:27:09,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:27:09,954 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:27:09,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:27:09,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:27:09,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:27:09,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:27:09,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:27:09,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:27:09,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:27:09,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:27:09,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:27:09,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:27:09,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:27:09,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:27:09,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:27:09,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:27:09,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:27:09,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:27:09,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:27:09,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:27:09,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:27:09,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:27:09,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:27:09,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:27:09,959 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:27:09,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:27:09,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:27:09,960 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:27:10,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:27:10,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:27:10,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:27:10,189 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:27:10,190 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:27:10,191 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.v_non-pipelined-microprocessor.yml/witness.yml [2024-08-14 14:27:10,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:27:10,286 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:27:10,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-08-14 14:27:11,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:27:11,879 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:27:11,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-08-14 14:27:11,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe48915d7/dd5569e9ad4b4d70ba59c1302dbf4333/FLAG3acb69d31 [2024-08-14 14:27:12,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe48915d7/dd5569e9ad4b4d70ba59c1302dbf4333 [2024-08-14 14:27:12,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:27:12,206 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:27:12,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:27:12,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:27:12,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:27:12,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:10" (1/2) ... [2024-08-14 14:27:12,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46577103 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:12, skipping insertion in model container [2024-08-14 14:27:12,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:10" (1/2) ... [2024-08-14 14:27:12,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3c9bf5e5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:12, skipping insertion in model container [2024-08-14 14:27:12,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:27:12" (2/2) ... [2024-08-14 14:27:12,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46577103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12, skipping insertion in model container [2024-08-14 14:27:12,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:27:12" (2/2) ... [2024-08-14 14:27:12,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:27:12,376 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.v_non-pipelined-microprocessor.c[1270,1283] [2024-08-14 14:27:12,492 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:27:12,514 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:27:12,524 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.v_non-pipelined-microprocessor.c[1270,1283] [2024-08-14 14:27:12,618 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:27:12,636 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:27:12,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12 WrapperNode [2024-08-14 14:27:12,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:27:12,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:27:12,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:27:12,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:27:12,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12" (1/1) ... [2024-08-14 14:27:12,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12" (1/1) ... [2024-08-14 14:27:12,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12" (1/1) ... [2024-08-14 14:27:12,713 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:27:12,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12" (1/1) ... [2024-08-14 14:27:12,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12" (1/1) ... [2024-08-14 14:27:12,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12" (1/1) ... [2024-08-14 14:27:12,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12" (1/1) ... [2024-08-14 14:27:12,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12" (1/1) ... [2024-08-14 14:27:12,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:27:12,763 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:27:12,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:27:12,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:27:12,764 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12" (1/1) ... [2024-08-14 14:27:12,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:27:12,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:12,797 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:27:12,806 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:12,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:27:12,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:27:12,841 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:27:12,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:27:12,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:27:12,842 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:27:12,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:27:12,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:27:12,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:27:12,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:27:12,842 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:27:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:27:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:27:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:27:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:27:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:27:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:27:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:27:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:27:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:27:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:27:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:27:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:27:13,034 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:27:13,036 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:27:13,936 INFO L? ?]: Removed 641 outVars from TransFormulas that were not future-live. [2024-08-14 14:27:13,936 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:27:13,947 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:27:13,948 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:27:13,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:13 BoogieIcfgContainer [2024-08-14 14:27:13,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:27:13,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:27:13,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:27:13,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:27:13,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:10" (1/4) ... [2024-08-14 14:27:13,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e2276a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:27:13, skipping insertion in model container [2024-08-14 14:27:13,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:27:12" (2/4) ... [2024-08-14 14:27:13,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e2276a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:13, skipping insertion in model container [2024-08-14 14:27:13,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:12" (3/4) ... [2024-08-14 14:27:13,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e2276a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:13, skipping insertion in model container [2024-08-14 14:27:13,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:13" (4/4) ... [2024-08-14 14:27:13,956 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-08-14 14:27:13,956 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:13,970 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:27:13,970 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:27:13,993 INFO L92 WitnessUtils]: Constructing product of automaton with 205 states and violation witness of the following lengths: [3] [2024-08-14 14:27:13,996 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 205 states, 197 states have (on average 1.6395939086294415) internal successors, (323), 198 states have internal predecessors, (323), 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:14,146 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 469 states to 454 states. [2024-08-14 14:27:14,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:27:14,167 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;@45ad61c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:27:14,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:27:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states. [2024-08-14 14:27:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-08-14 14:27:14,173 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:14,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:14,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:14,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash -16092596, now seen corresponding path program 1 times [2024-08-14 14:27:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:14,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23040920] [2024-08-14 14:27:14,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:15,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:15,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23040920] [2024-08-14 14:27:15,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23040920] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:15,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:15,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:15,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054692495] [2024-08-14 14:27:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:15,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:15,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:15,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:15,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:15,253 INFO L87 Difference]: Start difference. First operand 454 states. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:15,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:15,327 INFO L93 Difference]: Finished difference Result 370 states and 602 transitions. [2024-08-14 14:27:15,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:27:15,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2024-08-14 14:27:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:15,332 INFO L225 Difference]: With dead ends: 370 [2024-08-14 14:27:15,332 INFO L226 Difference]: Without dead ends: 370 [2024-08-14 14:27:15,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:27:15,336 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 130 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1586 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:27:15,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1586 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:27:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-08-14 14:27:15,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 205. [2024-08-14 14:27:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 197 states have (on average 1.6294416243654823) internal successors, (321), 198 states have internal predecessors, (321), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 328 transitions. [2024-08-14 14:27:15,375 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 328 transitions. Word has length 83 [2024-08-14 14:27:15,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:15,376 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 328 transitions. [2024-08-14 14:27:15,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:15,376 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 328 transitions. [2024-08-14 14:27:15,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-08-14 14:27:15,378 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:15,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:15,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:27:15,379 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:15,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2039950615, now seen corresponding path program 1 times [2024-08-14 14:27:15,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:15,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640662535] [2024-08-14 14:27:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:15,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:15,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640662535] [2024-08-14 14:27:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640662535] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:15,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:15,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:27:15,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977108463] [2024-08-14 14:27:15,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:15,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:27:15,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:15,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:27:15,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:27:15,696 INFO L87 Difference]: Start difference. First operand 205 states and 328 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:15,725 INFO L93 Difference]: Finished difference Result 207 states and 330 transitions. [2024-08-14 14:27:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:27:15,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2024-08-14 14:27:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:15,727 INFO L225 Difference]: With dead ends: 207 [2024-08-14 14:27:15,727 INFO L226 Difference]: Without dead ends: 207 [2024-08-14 14:27:15,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:27:15,728 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 0 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 953 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:27:15,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 953 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:27:15,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-08-14 14:27:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-08-14 14:27:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 199 states have (on average 1.6231155778894473) internal successors, (323), 200 states have internal predecessors, (323), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 330 transitions. [2024-08-14 14:27:15,736 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 330 transitions. Word has length 84 [2024-08-14 14:27:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:15,737 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 330 transitions. [2024-08-14 14:27:15,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 330 transitions. [2024-08-14 14:27:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-08-14 14:27:15,739 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:15,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:15,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:27:15,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:15,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:15,740 INFO L85 PathProgramCache]: Analyzing trace with hash 491150762, now seen corresponding path program 1 times [2024-08-14 14:27:15,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:15,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513562600] [2024-08-14 14:27:15,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:15,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:20,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:20,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:20,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513562600] [2024-08-14 14:27:20,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513562600] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:20,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:20,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-08-14 14:27:20,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023851244] [2024-08-14 14:27:20,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:20,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-14 14:27:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-14 14:27:20,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-08-14 14:27:20,298 INFO L87 Difference]: Start difference. First operand 207 states and 330 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:27,499 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 77 DAG size of output: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 14:27:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:30,699 INFO L93 Difference]: Finished difference Result 322 states and 516 transitions. [2024-08-14 14:27:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 14:27:30,700 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-08-14 14:27:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:30,701 INFO L225 Difference]: With dead ends: 322 [2024-08-14 14:27:30,701 INFO L226 Difference]: Without dead ends: 322 [2024-08-14 14:27:30,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-08-14 14:27:30,702 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 554 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:30,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1950 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-08-14 14:27:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-08-14 14:27:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 222. [2024-08-14 14:27:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 214 states have (on average 1.6168224299065421) internal successors, (346), 215 states have internal predecessors, (346), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 353 transitions. [2024-08-14 14:27:30,719 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 353 transitions. Word has length 85 [2024-08-14 14:27:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:30,719 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 353 transitions. [2024-08-14 14:27:30,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 353 transitions. [2024-08-14 14:27:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-08-14 14:27:30,721 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:30,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:30,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 14:27:30,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:30,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1664202737, now seen corresponding path program 1 times [2024-08-14 14:27:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420112090] [2024-08-14 14:27:30,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:34,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420112090] [2024-08-14 14:27:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420112090] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-08-14 14:27:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093617378] [2024-08-14 14:27:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:34,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-14 14:27:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:34,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-14 14:27:34,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-08-14 14:27:34,642 INFO L87 Difference]: Start difference. First operand 222 states and 353 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:37,238 INFO L93 Difference]: Finished difference Result 353 states and 565 transitions. [2024-08-14 14:27:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 14:27:37,239 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-08-14 14:27:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:37,241 INFO L225 Difference]: With dead ends: 353 [2024-08-14 14:27:37,241 INFO L226 Difference]: Without dead ends: 353 [2024-08-14 14:27:37,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2024-08-14 14:27:37,242 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 635 mSDsluCounter, 2005 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:37,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 2180 Invalid, 3123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-08-14 14:27:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-08-14 14:27:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 238. [2024-08-14 14:27:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 230 states have (on average 1.617391304347826) internal successors, (372), 231 states have internal predecessors, (372), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 379 transitions. [2024-08-14 14:27:37,249 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 379 transitions. Word has length 86 [2024-08-14 14:27:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:37,249 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 379 transitions. [2024-08-14 14:27:37,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 379 transitions. [2024-08-14 14:27:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-08-14 14:27:37,251 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:37,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:37,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-14 14:27:37,251 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:37,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:37,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1661183536, now seen corresponding path program 1 times [2024-08-14 14:27:37,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:37,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574015635] [2024-08-14 14:27:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:37,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:40,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574015635] [2024-08-14 14:27:40,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574015635] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:40,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:40,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-08-14 14:27:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129390497] [2024-08-14 14:27:40,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:40,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-14 14:27:40,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:40,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-14 14:27:40,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-08-14 14:27:40,870 INFO L87 Difference]: Start difference. First operand 238 states and 379 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:42,647 INFO L93 Difference]: Finished difference Result 377 states and 602 transitions. [2024-08-14 14:27:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 14:27:42,647 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-08-14 14:27:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:42,648 INFO L225 Difference]: With dead ends: 377 [2024-08-14 14:27:42,649 INFO L226 Difference]: Without dead ends: 377 [2024-08-14 14:27:42,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2024-08-14 14:27:42,650 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 777 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 3293 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:42,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 3293 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-08-14 14:27:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-08-14 14:27:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 249. [2024-08-14 14:27:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 242 states have internal predecessors, (390), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 397 transitions. [2024-08-14 14:27:42,657 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 397 transitions. Word has length 86 [2024-08-14 14:27:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:42,657 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 397 transitions. [2024-08-14 14:27:42,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 397 transitions. [2024-08-14 14:27:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-08-14 14:27:42,658 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:42,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:42,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 14:27:42,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:42,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:42,659 INFO L85 PathProgramCache]: Analyzing trace with hash 888999310, now seen corresponding path program 1 times [2024-08-14 14:27:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:42,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937537383] [2024-08-14 14:27:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:43,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:43,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:43,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937537383] [2024-08-14 14:27:43,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937537383] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:43,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:43,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:43,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100790867] [2024-08-14 14:27:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:43,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:43,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:43,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:43,118 INFO L87 Difference]: Start difference. First operand 249 states and 397 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:43,592 INFO L93 Difference]: Finished difference Result 265 states and 422 transitions. [2024-08-14 14:27:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:27:43,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-08-14 14:27:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:43,593 INFO L225 Difference]: With dead ends: 265 [2024-08-14 14:27:43,594 INFO L226 Difference]: Without dead ends: 265 [2024-08-14 14:27:43,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:43,594 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 304 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:43,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 655 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:27:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-08-14 14:27:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 251. [2024-08-14 14:27:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 243 states have (on average 1.6131687242798354) internal successors, (392), 244 states have internal predecessors, (392), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 399 transitions. [2024-08-14 14:27:43,608 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 399 transitions. Word has length 86 [2024-08-14 14:27:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:43,609 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 399 transitions. [2024-08-14 14:27:43,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 399 transitions. [2024-08-14 14:27:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-08-14 14:27:43,610 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:43,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:43,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-14 14:27:43,610 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:43,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash -294347987, now seen corresponding path program 1 times [2024-08-14 14:27:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:43,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291307731] [2024-08-14 14:27:43,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:43,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:44,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:44,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:44,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291307731] [2024-08-14 14:27:44,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291307731] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:44,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:44,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:44,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547469590] [2024-08-14 14:27:44,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:44,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:44,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:44,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:44,101 INFO L87 Difference]: Start difference. First operand 251 states and 399 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:44,580 INFO L93 Difference]: Finished difference Result 267 states and 424 transitions. [2024-08-14 14:27:44,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:27:44,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-08-14 14:27:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:44,583 INFO L225 Difference]: With dead ends: 267 [2024-08-14 14:27:44,584 INFO L226 Difference]: Without dead ends: 267 [2024-08-14 14:27:44,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:44,584 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 27 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:44,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1110 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:27:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-08-14 14:27:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 251. [2024-08-14 14:27:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 243 states have (on average 1.6131687242798354) internal successors, (392), 244 states have internal predecessors, (392), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 399 transitions. [2024-08-14 14:27:44,592 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 399 transitions. Word has length 86 [2024-08-14 14:27:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:44,593 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 399 transitions. [2024-08-14 14:27:44,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 399 transitions. [2024-08-14 14:27:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-08-14 14:27:44,595 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:44,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:44,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 14:27:44,596 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:44,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1002318490, now seen corresponding path program 1 times [2024-08-14 14:27:44,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:44,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962749112] [2024-08-14 14:27:44,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:44,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:44,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962749112] [2024-08-14 14:27:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962749112] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:44,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:44,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 14:27:44,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680179189] [2024-08-14 14:27:44,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:44,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:27:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:44,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:27:44,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:27:44,827 INFO L87 Difference]: Start difference. First operand 251 states and 399 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:44,872 INFO L93 Difference]: Finished difference Result 397 states and 631 transitions. [2024-08-14 14:27:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:27:44,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-08-14 14:27:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:44,874 INFO L225 Difference]: With dead ends: 397 [2024-08-14 14:27:44,875 INFO L226 Difference]: Without dead ends: 397 [2024-08-14 14:27:44,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:44,877 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 174 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:44,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1200 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:27:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-08-14 14:27:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 279. [2024-08-14 14:27:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 271 states have (on average 1.5977859778597785) internal successors, (433), 272 states have internal predecessors, (433), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 440 transitions. [2024-08-14 14:27:44,891 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 440 transitions. Word has length 86 [2024-08-14 14:27:44,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:44,894 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 440 transitions. [2024-08-14 14:27:44,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 440 transitions. [2024-08-14 14:27:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-08-14 14:27:44,895 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:44,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:44,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-14 14:27:44,896 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:44,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash 779685024, now seen corresponding path program 1 times [2024-08-14 14:27:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:44,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723099760] [2024-08-14 14:27:44,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:45,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:45,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723099760] [2024-08-14 14:27:45,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723099760] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:45,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:45,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 14:27:45,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616883459] [2024-08-14 14:27:45,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:45,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:27:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:45,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:27:45,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:27:45,115 INFO L87 Difference]: Start difference. First operand 279 states and 440 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:45,159 INFO L93 Difference]: Finished difference Result 383 states and 607 transitions. [2024-08-14 14:27:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:27:45,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-08-14 14:27:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:45,161 INFO L225 Difference]: With dead ends: 383 [2024-08-14 14:27:45,162 INFO L226 Difference]: Without dead ends: 383 [2024-08-14 14:27:45,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:45,163 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 175 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:45,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1200 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:27:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-08-14 14:27:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 273. [2024-08-14 14:27:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 265 states have (on average 1.5924528301886793) internal successors, (422), 266 states have internal predecessors, (422), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 429 transitions. [2024-08-14 14:27:45,171 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 429 transitions. Word has length 86 [2024-08-14 14:27:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:45,172 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 429 transitions. [2024-08-14 14:27:45,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 429 transitions. [2024-08-14 14:27:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-08-14 14:27:45,174 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:45,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:45,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-14 14:27:45,174 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:45,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:45,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1762292487, now seen corresponding path program 1 times [2024-08-14 14:27:45,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:45,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250290463] [2024-08-14 14:27:45,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:45,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250290463] [2024-08-14 14:27:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250290463] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:45,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:45,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 14:27:45,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472012799] [2024-08-14 14:27:45,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:45,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:27:45,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:45,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:27:45,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:27:45,709 INFO L87 Difference]: Start difference. First operand 273 states and 429 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:46,413 INFO L93 Difference]: Finished difference Result 365 states and 576 transitions. [2024-08-14 14:27:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:27:46,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-08-14 14:27:46,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:46,415 INFO L225 Difference]: With dead ends: 365 [2024-08-14 14:27:46,415 INFO L226 Difference]: Without dead ends: 365 [2024-08-14 14:27:46,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-08-14 14:27:46,416 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 549 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:46,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 832 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-08-14 14:27:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-08-14 14:27:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 278. [2024-08-14 14:27:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 270 states have (on average 1.5851851851851853) internal successors, (428), 271 states have internal predecessors, (428), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 435 transitions. [2024-08-14 14:27:46,422 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 435 transitions. Word has length 87 [2024-08-14 14:27:46,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:46,423 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 435 transitions. [2024-08-14 14:27:46,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 435 transitions. [2024-08-14 14:27:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-08-14 14:27:46,424 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:46,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:46,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-14 14:27:46,424 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:46,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash -561735352, now seen corresponding path program 1 times [2024-08-14 14:27:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632103489] [2024-08-14 14:27:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:46,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:46,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:46,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632103489] [2024-08-14 14:27:46,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632103489] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:46,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:46,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:46,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762226841] [2024-08-14 14:27:46,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:46,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:46,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:46,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:46,771 INFO L87 Difference]: Start difference. First operand 278 states and 435 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:47,112 INFO L93 Difference]: Finished difference Result 292 states and 457 transitions. [2024-08-14 14:27:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:27:47,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-08-14 14:27:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:47,113 INFO L225 Difference]: With dead ends: 292 [2024-08-14 14:27:47,114 INFO L226 Difference]: Without dead ends: 292 [2024-08-14 14:27:47,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:27:47,114 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 22 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:47,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 941 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:27:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-08-14 14:27:47,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 281. [2024-08-14 14:27:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 273 states have (on average 1.5824175824175823) internal successors, (432), 274 states have internal predecessors, (432), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 439 transitions. [2024-08-14 14:27:47,119 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 439 transitions. Word has length 87 [2024-08-14 14:27:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:47,120 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 439 transitions. [2024-08-14 14:27:47,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 439 transitions. [2024-08-14 14:27:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-08-14 14:27:47,120 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:47,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:47,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-14 14:27:47,121 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:47,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:47,121 INFO L85 PathProgramCache]: Analyzing trace with hash 391086045, now seen corresponding path program 1 times [2024-08-14 14:27:47,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:47,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116409056] [2024-08-14 14:27:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:47,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:47,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:47,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116409056] [2024-08-14 14:27:47,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116409056] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:47,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:47,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 14:27:47,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680567440] [2024-08-14 14:27:47,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:47,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:27:47,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:47,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:27:47,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:27:47,326 INFO L87 Difference]: Start difference. First operand 281 states and 439 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:47,373 INFO L93 Difference]: Finished difference Result 384 states and 601 transitions. [2024-08-14 14:27:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:27:47,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-08-14 14:27:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:47,375 INFO L225 Difference]: With dead ends: 384 [2024-08-14 14:27:47,375 INFO L226 Difference]: Without dead ends: 384 [2024-08-14 14:27:47,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:47,376 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 170 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:47,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1200 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:27:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-08-14 14:27:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 277. [2024-08-14 14:27:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 269 states have (on average 1.5762081784386617) internal successors, (424), 270 states have internal predecessors, (424), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 431 transitions. [2024-08-14 14:27:47,382 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 431 transitions. Word has length 87 [2024-08-14 14:27:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:47,382 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 431 transitions. [2024-08-14 14:27:47,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 431 transitions. [2024-08-14 14:27:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-08-14 14:27:47,383 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:47,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:47,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-14 14:27:47,383 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:47,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:47,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1622575560, now seen corresponding path program 1 times [2024-08-14 14:27:47,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:47,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284390359] [2024-08-14 14:27:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:47,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284390359] [2024-08-14 14:27:47,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284390359] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:47,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:47,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:47,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279798418] [2024-08-14 14:27:47,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:47,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:47,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:47,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:47,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:47,698 INFO L87 Difference]: Start difference. First operand 277 states and 431 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:47,886 INFO L93 Difference]: Finished difference Result 361 states and 566 transitions. [2024-08-14 14:27:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:27:47,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-08-14 14:27:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:47,888 INFO L225 Difference]: With dead ends: 361 [2024-08-14 14:27:47,888 INFO L226 Difference]: Without dead ends: 361 [2024-08-14 14:27:47,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:27:47,888 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 168 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:47,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1358 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:27:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-08-14 14:27:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 270. [2024-08-14 14:27:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 262 states have (on average 1.583969465648855) internal successors, (415), 263 states have internal predecessors, (415), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2024-08-14 14:27:47,893 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 422 transitions. Word has length 87 [2024-08-14 14:27:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:47,893 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 422 transitions. [2024-08-14 14:27:47,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 422 transitions. [2024-08-14 14:27:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-08-14 14:27:47,894 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:47,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:47,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-08-14 14:27:47,894 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:47,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1002291255, now seen corresponding path program 1 times [2024-08-14 14:27:47,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:47,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897915325] [2024-08-14 14:27:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:47,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:48,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:48,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:48,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897915325] [2024-08-14 14:27:48,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897915325] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:48,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:48,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:48,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331649057] [2024-08-14 14:27:48,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:48,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:48,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:48,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:48,439 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:48,983 INFO L93 Difference]: Finished difference Result 281 states and 439 transitions. [2024-08-14 14:27:48,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:27:48,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-08-14 14:27:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:48,985 INFO L225 Difference]: With dead ends: 281 [2024-08-14 14:27:48,985 INFO L226 Difference]: Without dead ends: 281 [2024-08-14 14:27:48,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:48,985 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 19 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:48,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1072 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-14 14:27:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-08-14 14:27:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 273. [2024-08-14 14:27:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 265 states have (on average 1.5811320754716982) internal successors, (419), 266 states have internal predecessors, (419), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 426 transitions. [2024-08-14 14:27:48,990 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 426 transitions. Word has length 88 [2024-08-14 14:27:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:48,990 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 426 transitions. [2024-08-14 14:27:48,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 426 transitions. [2024-08-14 14:27:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-08-14 14:27:48,991 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:48,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:48,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-08-14 14:27:48,991 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:48,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1698479194, now seen corresponding path program 1 times [2024-08-14 14:27:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:48,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337784050] [2024-08-14 14:27:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:49,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337784050] [2024-08-14 14:27:49,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337784050] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:49,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:49,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241905141] [2024-08-14 14:27:49,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:49,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:49,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:49,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:49,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:49,398 INFO L87 Difference]: Start difference. First operand 273 states and 426 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:49,793 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-08-14 14:27:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:27:49,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-08-14 14:27:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:49,794 INFO L225 Difference]: With dead ends: 281 [2024-08-14 14:27:49,794 INFO L226 Difference]: Without dead ends: 281 [2024-08-14 14:27:49,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:49,795 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 15 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:49,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1074 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:27:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-08-14 14:27:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 276. [2024-08-14 14:27:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 268 states have (on average 1.578358208955224) internal successors, (423), 269 states have internal predecessors, (423), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 430 transitions. [2024-08-14 14:27:49,807 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 430 transitions. Word has length 89 [2024-08-14 14:27:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:49,807 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 430 transitions. [2024-08-14 14:27:49,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 430 transitions. [2024-08-14 14:27:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-08-14 14:27:49,808 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:49,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:49,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-14 14:27:49,809 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:49,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash -661127674, now seen corresponding path program 1 times [2024-08-14 14:27:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:49,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145762310] [2024-08-14 14:27:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:50,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:50,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:50,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145762310] [2024-08-14 14:27:50,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145762310] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:50,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:50,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-14 14:27:50,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912118148] [2024-08-14 14:27:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:50,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-14 14:27:50,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:50,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-14 14:27:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-08-14 14:27:50,445 INFO L87 Difference]: Start difference. First operand 276 states and 430 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:51,288 INFO L93 Difference]: Finished difference Result 372 states and 581 transitions. [2024-08-14 14:27:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:27:51,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-08-14 14:27:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:51,290 INFO L225 Difference]: With dead ends: 372 [2024-08-14 14:27:51,290 INFO L226 Difference]: Without dead ends: 372 [2024-08-14 14:27:51,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-08-14 14:27:51,291 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 538 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:51,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1244 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-08-14 14:27:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-08-14 14:27:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 282. [2024-08-14 14:27:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 274 states have (on average 1.5693430656934306) internal successors, (430), 275 states have internal predecessors, (430), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 437 transitions. [2024-08-14 14:27:51,309 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 437 transitions. Word has length 90 [2024-08-14 14:27:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:51,309 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 437 transitions. [2024-08-14 14:27:51,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 437 transitions. [2024-08-14 14:27:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-08-14 14:27:51,309 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:51,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:51,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-08-14 14:27:51,310 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:51,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:51,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1309811783, now seen corresponding path program 1 times [2024-08-14 14:27:51,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:51,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994396029] [2024-08-14 14:27:51,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:51,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:51,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994396029] [2024-08-14 14:27:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994396029] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:51,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 14:27:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040927399] [2024-08-14 14:27:51,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:51,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:27:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:51,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:27:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:51,873 INFO L87 Difference]: Start difference. First operand 282 states and 437 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:52,661 INFO L93 Difference]: Finished difference Result 372 states and 579 transitions. [2024-08-14 14:27:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:27:52,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-08-14 14:27:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:52,663 INFO L225 Difference]: With dead ends: 372 [2024-08-14 14:27:52,664 INFO L226 Difference]: Without dead ends: 372 [2024-08-14 14:27:52,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-08-14 14:27:52,664 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 529 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:52,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1066 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-08-14 14:27:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-08-14 14:27:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 294. [2024-08-14 14:27:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 286 states have (on average 1.5594405594405594) internal successors, (446), 287 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 453 transitions. [2024-08-14 14:27:52,673 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 453 transitions. Word has length 90 [2024-08-14 14:27:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:52,673 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 453 transitions. [2024-08-14 14:27:52,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 453 transitions. [2024-08-14 14:27:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-08-14 14:27:52,674 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:52,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:52,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-08-14 14:27:52,674 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:52,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:52,675 INFO L85 PathProgramCache]: Analyzing trace with hash -625848504, now seen corresponding path program 1 times [2024-08-14 14:27:52,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:52,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638204945] [2024-08-14 14:27:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:52,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:53,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:53,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638204945] [2024-08-14 14:27:53,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638204945] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:53,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:53,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37641140] [2024-08-14 14:27:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:53,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:53,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:53,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:53,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:53,119 INFO L87 Difference]: Start difference. First operand 294 states and 453 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:53,441 INFO L93 Difference]: Finished difference Result 299 states and 460 transitions. [2024-08-14 14:27:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:27:53,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-08-14 14:27:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:53,442 INFO L225 Difference]: With dead ends: 299 [2024-08-14 14:27:53,442 INFO L226 Difference]: Without dead ends: 299 [2024-08-14 14:27:53,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:53,444 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 11 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:53,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1076 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:27:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-08-14 14:27:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2024-08-14 14:27:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 289 states have (on average 1.5570934256055364) internal successors, (450), 290 states have internal predecessors, (450), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 457 transitions. [2024-08-14 14:27:53,465 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 457 transitions. Word has length 90 [2024-08-14 14:27:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:53,465 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 457 transitions. [2024-08-14 14:27:53,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 457 transitions. [2024-08-14 14:27:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-08-14 14:27:53,466 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:53,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:53,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-08-14 14:27:53,466 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:53,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:53,467 INFO L85 PathProgramCache]: Analyzing trace with hash -646337407, now seen corresponding path program 1 times [2024-08-14 14:27:53,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:53,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234519028] [2024-08-14 14:27:53,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:53,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:53,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:53,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234519028] [2024-08-14 14:27:53,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234519028] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:53,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:53,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 14:27:53,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321137336] [2024-08-14 14:27:53,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:53,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:27:53,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:53,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:27:53,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:53,939 INFO L87 Difference]: Start difference. First operand 297 states and 457 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:54,626 INFO L93 Difference]: Finished difference Result 378 states and 585 transitions. [2024-08-14 14:27:54,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:27:54,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-08-14 14:27:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:54,628 INFO L225 Difference]: With dead ends: 378 [2024-08-14 14:27:54,628 INFO L226 Difference]: Without dead ends: 378 [2024-08-14 14:27:54,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-08-14 14:27:54,629 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 559 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:54,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 966 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-08-14 14:27:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-08-14 14:27:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 303. [2024-08-14 14:27:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 295 states have (on average 1.5491525423728814) internal successors, (457), 296 states have internal predecessors, (457), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 464 transitions. [2024-08-14 14:27:54,633 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 464 transitions. Word has length 91 [2024-08-14 14:27:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:54,634 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 464 transitions. [2024-08-14 14:27:54,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 464 transitions. [2024-08-14 14:27:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-08-14 14:27:54,634 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:54,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:54,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-08-14 14:27:54,635 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:54,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1569020990, now seen corresponding path program 1 times [2024-08-14 14:27:54,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:54,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574970694] [2024-08-14 14:27:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:54,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:54,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574970694] [2024-08-14 14:27:54,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574970694] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:54,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:54,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100337161] [2024-08-14 14:27:54,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:54,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:54,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:54,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:54,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:54,946 INFO L87 Difference]: Start difference. First operand 303 states and 464 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:55,302 INFO L93 Difference]: Finished difference Result 306 states and 468 transitions. [2024-08-14 14:27:55,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:27:55,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-08-14 14:27:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:55,304 INFO L225 Difference]: With dead ends: 306 [2024-08-14 14:27:55,304 INFO L226 Difference]: Without dead ends: 306 [2024-08-14 14:27:55,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:55,305 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 7 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:55,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1070 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:27:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-08-14 14:27:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-08-14 14:27:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 298 states have (on average 1.5469798657718121) internal successors, (461), 299 states have internal predecessors, (461), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 468 transitions. [2024-08-14 14:27:55,315 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 468 transitions. Word has length 91 [2024-08-14 14:27:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:55,315 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 468 transitions. [2024-08-14 14:27:55,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 468 transitions. [2024-08-14 14:27:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-08-14 14:27:55,316 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:55,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:55,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-08-14 14:27:55,316 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:55,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:55,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1114832796, now seen corresponding path program 1 times [2024-08-14 14:27:55,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:55,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694752654] [2024-08-14 14:27:55,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:55,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:55,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:55,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:55,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694752654] [2024-08-14 14:27:55,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694752654] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:55,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:55,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 14:27:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673249263] [2024-08-14 14:27:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:55,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:27:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:27:55,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:55,800 INFO L87 Difference]: Start difference. First operand 306 states and 468 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:56,504 INFO L93 Difference]: Finished difference Result 384 states and 591 transitions. [2024-08-14 14:27:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:27:56,505 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-08-14 14:27:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:56,506 INFO L225 Difference]: With dead ends: 384 [2024-08-14 14:27:56,507 INFO L226 Difference]: Without dead ends: 384 [2024-08-14 14:27:56,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-08-14 14:27:56,508 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 527 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:56,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 888 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-08-14 14:27:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-08-14 14:27:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 312. [2024-08-14 14:27:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 305 states have internal predecessors, (468), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 475 transitions. [2024-08-14 14:27:56,517 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 475 transitions. Word has length 92 [2024-08-14 14:27:56,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:56,517 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 475 transitions. [2024-08-14 14:27:56,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:27:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 475 transitions. [2024-08-14 14:27:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-08-14 14:27:56,519 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:56,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:56,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-08-14 14:27:56,519 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:56,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:56,520 INFO L85 PathProgramCache]: Analyzing trace with hash -785067035, now seen corresponding path program 1 times [2024-08-14 14:27:56,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:56,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154836970] [2024-08-14 14:27:56,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:56,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:27:59,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:59,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154836970] [2024-08-14 14:27:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154836970] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:59,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-08-14 14:27:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102186194] [2024-08-14 14:27:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:59,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-14 14:27:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-14 14:27:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:27:59,673 INFO L87 Difference]: Start difference. First operand 312 states and 475 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:00,948 INFO L93 Difference]: Finished difference Result 525 states and 798 transitions. [2024-08-14 14:28:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 14:28:00,948 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-08-14 14:28:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:00,950 INFO L225 Difference]: With dead ends: 525 [2024-08-14 14:28:00,950 INFO L226 Difference]: Without dead ends: 525 [2024-08-14 14:28:00,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2024-08-14 14:28:00,951 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 738 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:00,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 2102 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-08-14 14:28:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-08-14 14:28:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 390. [2024-08-14 14:28:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 382 states have (on average 1.5104712041884816) internal successors, (577), 383 states have internal predecessors, (577), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 584 transitions. [2024-08-14 14:28:00,957 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 584 transitions. Word has length 92 [2024-08-14 14:28:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:00,957 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 584 transitions. [2024-08-14 14:28:00,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 584 transitions. [2024-08-14 14:28:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:00,958 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:00,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:00,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-08-14 14:28:00,958 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:00,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1732623299, now seen corresponding path program 1 times [2024-08-14 14:28:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358667463] [2024-08-14 14:28:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:01,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358667463] [2024-08-14 14:28:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358667463] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:01,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:01,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:28:01,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548282097] [2024-08-14 14:28:01,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:01,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:28:01,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:01,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:28:01,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:28:01,502 INFO L87 Difference]: Start difference. First operand 390 states and 584 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:01,925 INFO L93 Difference]: Finished difference Result 406 states and 604 transitions. [2024-08-14 14:28:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:28:01,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:01,927 INFO L225 Difference]: With dead ends: 406 [2024-08-14 14:28:01,927 INFO L226 Difference]: Without dead ends: 406 [2024-08-14 14:28:01,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:28:01,927 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 289 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:01,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 667 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:28:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-08-14 14:28:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 396. [2024-08-14 14:28:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 388 states have (on average 1.5051546391752577) internal successors, (584), 389 states have internal predecessors, (584), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 591 transitions. [2024-08-14 14:28:01,934 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 591 transitions. Word has length 93 [2024-08-14 14:28:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:01,934 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 591 transitions. [2024-08-14 14:28:01,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 591 transitions. [2024-08-14 14:28:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:01,935 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:01,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:01,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-08-14 14:28:01,936 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:01,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash -549276002, now seen corresponding path program 1 times [2024-08-14 14:28:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:01,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787861483] [2024-08-14 14:28:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:02,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:02,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787861483] [2024-08-14 14:28:02,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787861483] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:02,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:02,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:28:02,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892384502] [2024-08-14 14:28:02,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:02,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:28:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:02,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:28:02,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:28:02,572 INFO L87 Difference]: Start difference. First operand 396 states and 591 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:03,083 INFO L93 Difference]: Finished difference Result 503 states and 758 transitions. [2024-08-14 14:28:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:28:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:03,085 INFO L225 Difference]: With dead ends: 503 [2024-08-14 14:28:03,085 INFO L226 Difference]: Without dead ends: 503 [2024-08-14 14:28:03,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-08-14 14:28:03,086 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 506 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:03,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 719 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-14 14:28:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-08-14 14:28:03,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 401. [2024-08-14 14:28:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 393 states have (on average 1.5012722646310432) internal successors, (590), 394 states have internal predecessors, (590), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 597 transitions. [2024-08-14 14:28:03,091 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 597 transitions. Word has length 93 [2024-08-14 14:28:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:03,091 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 597 transitions. [2024-08-14 14:28:03,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 597 transitions. [2024-08-14 14:28:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:03,092 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:03,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:03,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-08-14 14:28:03,092 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:03,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash -963453284, now seen corresponding path program 1 times [2024-08-14 14:28:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900805420] [2024-08-14 14:28:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:03,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:03,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:03,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:03,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900805420] [2024-08-14 14:28:03,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900805420] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:03,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:03,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 14:28:03,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042231751] [2024-08-14 14:28:03,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:03,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:28:03,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:03,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:28:03,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:28:03,503 INFO L87 Difference]: Start difference. First operand 401 states and 597 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:04,218 INFO L93 Difference]: Finished difference Result 503 states and 756 transitions. [2024-08-14 14:28:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:28:04,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:04,220 INFO L225 Difference]: With dead ends: 503 [2024-08-14 14:28:04,220 INFO L226 Difference]: Without dead ends: 503 [2024-08-14 14:28:04,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:28:04,221 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 529 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:04,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 870 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-08-14 14:28:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-08-14 14:28:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 407. [2024-08-14 14:28:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 399 states have (on average 1.4962406015037595) internal successors, (597), 400 states have internal predecessors, (597), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2024-08-14 14:28:04,226 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 93 [2024-08-14 14:28:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:04,227 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2024-08-14 14:28:04,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2024-08-14 14:28:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:04,227 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:04,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:04,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-08-14 14:28:04,228 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:04,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash -971212643, now seen corresponding path program 1 times [2024-08-14 14:28:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:04,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503557948] [2024-08-14 14:28:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503557948] [2024-08-14 14:28:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503557948] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:04,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 14:28:04,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53564639] [2024-08-14 14:28:04,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:04,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:28:04,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:28:04,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:28:04,691 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:05,374 INFO L93 Difference]: Finished difference Result 503 states and 754 transitions. [2024-08-14 14:28:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:28:05,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:05,376 INFO L225 Difference]: With dead ends: 503 [2024-08-14 14:28:05,376 INFO L226 Difference]: Without dead ends: 503 [2024-08-14 14:28:05,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:28:05,376 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 520 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:05,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 870 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-08-14 14:28:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-08-14 14:28:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 419. [2024-08-14 14:28:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 411 states have (on average 1.491484184914842) internal successors, (613), 412 states have internal predecessors, (613), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 620 transitions. [2024-08-14 14:28:05,382 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 620 transitions. Word has length 93 [2024-08-14 14:28:05,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:05,382 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 620 transitions. [2024-08-14 14:28:05,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 620 transitions. [2024-08-14 14:28:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:05,383 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:05,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:05,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-08-14 14:28:05,383 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:05,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1419909282, now seen corresponding path program 1 times [2024-08-14 14:28:05,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:05,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698111088] [2024-08-14 14:28:05,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:05,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:05,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:05,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698111088] [2024-08-14 14:28:05,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698111088] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:05,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:05,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 14:28:05,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383834482] [2024-08-14 14:28:05,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:05,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:28:05,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:05,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:28:05,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:28:05,788 INFO L87 Difference]: Start difference. First operand 419 states and 620 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:06,525 INFO L93 Difference]: Finished difference Result 503 states and 752 transitions. [2024-08-14 14:28:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:28:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:06,527 INFO L225 Difference]: With dead ends: 503 [2024-08-14 14:28:06,527 INFO L226 Difference]: Without dead ends: 503 [2024-08-14 14:28:06,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:28:06,528 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 514 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:06,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 870 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-08-14 14:28:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-08-14 14:28:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 425. [2024-08-14 14:28:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 417 states have (on average 1.486810551558753) internal successors, (620), 418 states have internal predecessors, (620), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 627 transitions. [2024-08-14 14:28:06,535 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 627 transitions. Word has length 93 [2024-08-14 14:28:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:06,535 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 627 transitions. [2024-08-14 14:28:06,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 627 transitions. [2024-08-14 14:28:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:06,536 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:06,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:06,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-08-14 14:28:06,536 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:06,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash 41670717, now seen corresponding path program 1 times [2024-08-14 14:28:06,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:06,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066282432] [2024-08-14 14:28:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:07,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:07,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066282432] [2024-08-14 14:28:07,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066282432] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:07,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:07,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:28:07,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742452551] [2024-08-14 14:28:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:07,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:28:07,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:07,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:28:07,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:28:07,622 INFO L87 Difference]: Start difference. First operand 425 states and 627 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:07,895 INFO L93 Difference]: Finished difference Result 396 states and 588 transitions. [2024-08-14 14:28:07,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:28:07,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:07,896 INFO L225 Difference]: With dead ends: 396 [2024-08-14 14:28:07,897 INFO L226 Difference]: Without dead ends: 396 [2024-08-14 14:28:07,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:28:07,897 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 278 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:07,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 346 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:28:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-08-14 14:28:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 384. [2024-08-14 14:28:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 376 states have (on average 1.4946808510638299) internal successors, (562), 377 states have internal predecessors, (562), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 569 transitions. [2024-08-14 14:28:07,903 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 569 transitions. Word has length 93 [2024-08-14 14:28:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:07,903 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 569 transitions. [2024-08-14 14:28:07,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 569 transitions. [2024-08-14 14:28:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:07,904 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:07,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:07,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-08-14 14:28:07,904 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:07,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash 144116703, now seen corresponding path program 1 times [2024-08-14 14:28:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433584984] [2024-08-14 14:28:07,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:11,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:11,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433584984] [2024-08-14 14:28:11,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433584984] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:11,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:11,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-08-14 14:28:11,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690818953] [2024-08-14 14:28:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:11,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-14 14:28:11,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:11,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-14 14:28:11,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-08-14 14:28:11,047 INFO L87 Difference]: Start difference. First operand 384 states and 569 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:13,558 INFO L93 Difference]: Finished difference Result 689 states and 1025 transitions. [2024-08-14 14:28:13,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 14:28:13,559 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:13,561 INFO L225 Difference]: With dead ends: 689 [2024-08-14 14:28:13,561 INFO L226 Difference]: Without dead ends: 689 [2024-08-14 14:28:13,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-08-14 14:28:13,561 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 910 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:13,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1767 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-08-14 14:28:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-08-14 14:28:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 424. [2024-08-14 14:28:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 416 states have (on average 1.4879807692307692) internal successors, (619), 417 states have internal predecessors, (619), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 626 transitions. [2024-08-14 14:28:13,567 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 626 transitions. Word has length 93 [2024-08-14 14:28:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:13,567 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 626 transitions. [2024-08-14 14:28:13,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 626 transitions. [2024-08-14 14:28:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:13,568 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:13,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:13,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-08-14 14:28:13,568 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:13,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:13,568 INFO L85 PathProgramCache]: Analyzing trace with hash -270060579, now seen corresponding path program 1 times [2024-08-14 14:28:13,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:13,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302931625] [2024-08-14 14:28:13,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:13,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:15,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:15,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302931625] [2024-08-14 14:28:15,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302931625] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:15,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:15,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-08-14 14:28:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448090164] [2024-08-14 14:28:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:15,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-14 14:28:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:15,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-14 14:28:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:28:15,840 INFO L87 Difference]: Start difference. First operand 424 states and 626 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:17,855 INFO L93 Difference]: Finished difference Result 587 states and 868 transitions. [2024-08-14 14:28:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 14:28:17,856 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:17,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:17,858 INFO L225 Difference]: With dead ends: 587 [2024-08-14 14:28:17,858 INFO L226 Difference]: Without dead ends: 587 [2024-08-14 14:28:17,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2024-08-14 14:28:17,858 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 656 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:17,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1591 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-08-14 14:28:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-08-14 14:28:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 441. [2024-08-14 14:28:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 433 states have (on average 1.4780600461893765) internal successors, (640), 434 states have internal predecessors, (640), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 647 transitions. [2024-08-14 14:28:17,863 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 647 transitions. Word has length 93 [2024-08-14 14:28:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:17,864 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 647 transitions. [2024-08-14 14:28:17,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 647 transitions. [2024-08-14 14:28:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:17,864 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:17,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:17,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-08-14 14:28:17,865 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:17,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -277819938, now seen corresponding path program 1 times [2024-08-14 14:28:17,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:17,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857978390] [2024-08-14 14:28:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:17,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:19,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:19,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857978390] [2024-08-14 14:28:19,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857978390] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:19,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:19,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-08-14 14:28:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107844702] [2024-08-14 14:28:19,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:19,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 14:28:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:19,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 14:28:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-08-14 14:28:19,909 INFO L87 Difference]: Start difference. First operand 441 states and 647 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:21,386 INFO L93 Difference]: Finished difference Result 584 states and 862 transitions. [2024-08-14 14:28:21,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 14:28:21,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:21,388 INFO L225 Difference]: With dead ends: 584 [2024-08-14 14:28:21,389 INFO L226 Difference]: Without dead ends: 584 [2024-08-14 14:28:21,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-08-14 14:28:21,389 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 646 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:21,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1339 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-08-14 14:28:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-08-14 14:28:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 462. [2024-08-14 14:28:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 454 states have (on average 1.4647577092511013) internal successors, (665), 455 states have internal predecessors, (665), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 672 transitions. [2024-08-14 14:28:21,400 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 672 transitions. Word has length 93 [2024-08-14 14:28:21,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:21,400 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 672 transitions. [2024-08-14 14:28:21,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 672 transitions. [2024-08-14 14:28:21,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:21,401 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:21,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:21,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-08-14 14:28:21,401 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:21,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:21,402 INFO L85 PathProgramCache]: Analyzing trace with hash -726516577, now seen corresponding path program 1 times [2024-08-14 14:28:21,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:21,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729707396] [2024-08-14 14:28:21,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:23,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:23,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729707396] [2024-08-14 14:28:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729707396] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:23,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-14 14:28:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049200969] [2024-08-14 14:28:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:23,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-14 14:28:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:23,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-14 14:28:23,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:28:23,508 INFO L87 Difference]: Start difference. First operand 462 states and 672 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:24,832 INFO L93 Difference]: Finished difference Result 688 states and 1005 transitions. [2024-08-14 14:28:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 14:28:24,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:24,834 INFO L225 Difference]: With dead ends: 688 [2024-08-14 14:28:24,837 INFO L226 Difference]: Without dead ends: 688 [2024-08-14 14:28:24,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-08-14 14:28:24,838 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 664 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:24,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1211 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-08-14 14:28:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-08-14 14:28:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 484. [2024-08-14 14:28:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 476 states have (on average 1.4705882352941178) internal successors, (700), 477 states have internal predecessors, (700), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 707 transitions. [2024-08-14 14:28:24,851 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 707 transitions. Word has length 93 [2024-08-14 14:28:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:24,851 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 707 transitions. [2024-08-14 14:28:24,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 707 transitions. [2024-08-14 14:28:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:24,852 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:24,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:24,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-08-14 14:28:24,852 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:24,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:24,852 INFO L85 PathProgramCache]: Analyzing trace with hash 735063422, now seen corresponding path program 1 times [2024-08-14 14:28:24,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277526608] [2024-08-14 14:28:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:27,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:27,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:27,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277526608] [2024-08-14 14:28:27,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277526608] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:27,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:27,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-08-14 14:28:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437770052] [2024-08-14 14:28:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:27,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-14 14:28:27,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:27,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-14 14:28:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-08-14 14:28:27,652 INFO L87 Difference]: Start difference. First operand 484 states and 707 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:29,444 INFO L93 Difference]: Finished difference Result 637 states and 933 transitions. [2024-08-14 14:28:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 14:28:29,446 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:29,448 INFO L225 Difference]: With dead ends: 637 [2024-08-14 14:28:29,448 INFO L226 Difference]: Without dead ends: 637 [2024-08-14 14:28:29,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2024-08-14 14:28:29,450 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 760 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:29,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1686 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-08-14 14:28:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-08-14 14:28:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 482. [2024-08-14 14:28:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 474 states have (on average 1.4725738396624473) internal successors, (698), 475 states have internal predecessors, (698), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 705 transitions. [2024-08-14 14:28:29,457 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 705 transitions. Word has length 93 [2024-08-14 14:28:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:29,458 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 705 transitions. [2024-08-14 14:28:29,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 705 transitions. [2024-08-14 14:28:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:29,459 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:29,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:29,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-08-14 14:28:29,459 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:29,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1064829183, now seen corresponding path program 1 times [2024-08-14 14:28:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:29,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544718027] [2024-08-14 14:28:29,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:32,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:32,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544718027] [2024-08-14 14:28:32,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544718027] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:32,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:32,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-08-14 14:28:32,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736930315] [2024-08-14 14:28:32,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:32,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-14 14:28:32,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:32,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-14 14:28:32,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-08-14 14:28:32,568 INFO L87 Difference]: Start difference. First operand 482 states and 705 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:34,670 INFO L93 Difference]: Finished difference Result 700 states and 1021 transitions. [2024-08-14 14:28:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 14:28:34,670 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:34,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:34,672 INFO L225 Difference]: With dead ends: 700 [2024-08-14 14:28:34,672 INFO L226 Difference]: Without dead ends: 700 [2024-08-14 14:28:34,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-08-14 14:28:34,673 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 759 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:34,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1686 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-08-14 14:28:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-08-14 14:28:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 586. [2024-08-14 14:28:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 578 states have (on average 1.439446366782007) internal successors, (832), 579 states have internal predecessors, (832), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 839 transitions. [2024-08-14 14:28:34,680 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 839 transitions. Word has length 93 [2024-08-14 14:28:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:34,680 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 839 transitions. [2024-08-14 14:28:34,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 839 transitions. [2024-08-14 14:28:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-08-14 14:28:34,681 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:34,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:34,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-08-14 14:28:34,681 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:34,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2090321182, now seen corresponding path program 1 times [2024-08-14 14:28:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918166950] [2024-08-14 14:28:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:35,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:35,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:35,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918166950] [2024-08-14 14:28:35,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918166950] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:35,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:35,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 14:28:35,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528124977] [2024-08-14 14:28:35,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:35,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:28:35,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:28:35,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:28:35,523 INFO L87 Difference]: Start difference. First operand 586 states and 839 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:35,606 INFO L93 Difference]: Finished difference Result 733 states and 1050 transitions. [2024-08-14 14:28:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:28:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-08-14 14:28:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:35,608 INFO L225 Difference]: With dead ends: 733 [2024-08-14 14:28:35,608 INFO L226 Difference]: Without dead ends: 733 [2024-08-14 14:28:35,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-08-14 14:28:35,609 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 147 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:35,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 2098 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:28:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-08-14 14:28:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 674. [2024-08-14 14:28:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 666 states have (on average 1.4234234234234233) internal successors, (948), 667 states have internal predecessors, (948), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 955 transitions. [2024-08-14 14:28:35,629 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 955 transitions. Word has length 93 [2024-08-14 14:28:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:35,629 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 955 transitions. [2024-08-14 14:28:35,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 955 transitions. [2024-08-14 14:28:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-08-14 14:28:35,630 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:35,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:35,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-08-14 14:28:35,630 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:35,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 26670407, now seen corresponding path program 1 times [2024-08-14 14:28:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543184516] [2024-08-14 14:28:35,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:35,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543184516] [2024-08-14 14:28:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543184516] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:35,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:35,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:28:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637995452] [2024-08-14 14:28:35,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:35,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:28:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:28:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:28:35,973 INFO L87 Difference]: Start difference. First operand 674 states and 955 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:36,005 INFO L93 Difference]: Finished difference Result 703 states and 1001 transitions. [2024-08-14 14:28:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:28:36,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-08-14 14:28:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:36,007 INFO L225 Difference]: With dead ends: 703 [2024-08-14 14:28:36,007 INFO L226 Difference]: Without dead ends: 703 [2024-08-14 14:28:36,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:28:36,008 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 25 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:36,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1572 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:28:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-08-14 14:28:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2024-08-14 14:28:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 695 states have (on average 1.4302158273381296) internal successors, (994), 696 states have internal predecessors, (994), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1001 transitions. [2024-08-14 14:28:36,015 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1001 transitions. Word has length 94 [2024-08-14 14:28:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:36,015 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1001 transitions. [2024-08-14 14:28:36,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1001 transitions. [2024-08-14 14:28:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-08-14 14:28:36,016 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:36,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:36,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-08-14 14:28:36,016 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:36,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:36,016 INFO L85 PathProgramCache]: Analyzing trace with hash 155753126, now seen corresponding path program 1 times [2024-08-14 14:28:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:36,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577664057] [2024-08-14 14:28:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:36,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:36,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:36,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:36,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577664057] [2024-08-14 14:28:36,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577664057] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:36,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:36,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 14:28:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975354465] [2024-08-14 14:28:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:36,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:28:36,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:36,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:28:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:28:36,828 INFO L87 Difference]: Start difference. First operand 703 states and 1001 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:37,497 INFO L93 Difference]: Finished difference Result 883 states and 1287 transitions. [2024-08-14 14:28:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 14:28:37,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-08-14 14:28:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:37,500 INFO L225 Difference]: With dead ends: 883 [2024-08-14 14:28:37,500 INFO L226 Difference]: Without dead ends: 883 [2024-08-14 14:28:37,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-08-14 14:28:37,501 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 285 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:37,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1330 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-08-14 14:28:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-08-14 14:28:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 746. [2024-08-14 14:28:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 738 states have (on average 1.4403794037940378) internal successors, (1063), 739 states have internal predecessors, (1063), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1070 transitions. [2024-08-14 14:28:37,508 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1070 transitions. Word has length 94 [2024-08-14 14:28:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:37,508 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 1070 transitions. [2024-08-14 14:28:37,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1070 transitions. [2024-08-14 14:28:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-08-14 14:28:37,509 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:37,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:37,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-08-14 14:28:37,509 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:37,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1179244438, now seen corresponding path program 1 times [2024-08-14 14:28:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599472947] [2024-08-14 14:28:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:37,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 14:28:40,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599472947] [2024-08-14 14:28:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599472947] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:40,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:40,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-08-14 14:28:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250123760] [2024-08-14 14:28:40,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:40,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-14 14:28:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:40,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-14 14:28:40,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:28:40,043 INFO L87 Difference]: Start difference. First operand 746 states and 1070 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:41,191 INFO L93 Difference]: Finished difference Result 1003 states and 1482 transitions. [2024-08-14 14:28:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 14:28:41,191 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-08-14 14:28:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:41,194 INFO L225 Difference]: With dead ends: 1003 [2024-08-14 14:28:41,194 INFO L226 Difference]: Without dead ends: 1003 [2024-08-14 14:28:41,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-08-14 14:28:41,195 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 347 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:41,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1415 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-08-14 14:28:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-08-14 14:28:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 810. [2024-08-14 14:28:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 802 states have (on average 1.4463840399002494) internal successors, (1160), 803 states have internal predecessors, (1160), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1167 transitions. [2024-08-14 14:28:41,203 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1167 transitions. Word has length 94 [2024-08-14 14:28:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:41,203 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 1167 transitions. [2024-08-14 14:28:41,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-14 14:28:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1167 transitions. [2024-08-14 14:28:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-08-14 14:28:41,204 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:41,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:41,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-08-14 14:28:41,204 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:41,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1684803063, now seen corresponding path program 1 times [2024-08-14 14:28:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897124013] [2024-08-14 14:28:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:41,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:28:41,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:28:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:28:41,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:28:41,914 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:28:41,915 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:28:41,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-08-14 14:28:41,919 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:41,922 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:28:41,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:28:41 BoogieIcfgContainer [2024-08-14 14:28:41,998 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:28:41,999 INFO L158 Benchmark]: Toolchain (without parser) took 89793.50ms. Allocated memory was 199.2MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 168.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 968.9MB. Max. memory is 16.1GB. [2024-08-14 14:28:41,999 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:28:41,999 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 132.1MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:28:41,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.33ms. Allocated memory is still 199.2MB. Free memory was 168.9MB in the beginning and 139.8MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-08-14 14:28:41,999 INFO L158 Benchmark]: Boogie Preprocessor took 125.11ms. Allocated memory is still 199.2MB. Free memory was 139.8MB in the beginning and 131.1MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-08-14 14:28:41,999 INFO L158 Benchmark]: IcfgBuilder took 1185.41ms. Allocated memory is still 199.2MB. Free memory was 131.1MB in the beginning and 134.0MB in the end (delta: -2.9MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2024-08-14 14:28:42,000 INFO L158 Benchmark]: TraceAbstraction took 88048.51ms. Allocated memory was 199.2MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 134.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 933.0MB. Max. memory is 16.1GB. [2024-08-14 14:28:42,000 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.16ms. Allocated memory is still 132.1MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 132.1MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.33ms. Allocated memory is still 199.2MB. Free memory was 168.9MB in the beginning and 139.8MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.11ms. Allocated memory is still 199.2MB. Free memory was 139.8MB in the beginning and 131.1MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1185.41ms. Allocated memory is still 199.2MB. Free memory was 131.1MB in the beginning and 134.0MB in the end (delta: -2.9MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * TraceAbstraction took 88048.51ms. Allocated memory was 199.2MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 134.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 933.0MB. 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 354. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 12); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (12 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L35] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 32); [L36] const SORT_9 msb_SORT_9 = (SORT_9)1 << (32 - 1); [L38] const SORT_46 mask_SORT_46 = (SORT_46)-1 >> (sizeof(SORT_46) * 8 - 5); [L39] const SORT_46 msb_SORT_46 = (SORT_46)1 << (5 - 1); [L41] const SORT_3 var_4 = 576; [L42] const SORT_5 var_6 = 0; [L43] const SORT_9 var_11 = 6; [L44] const SORT_3 var_14 = 36; [L45] const SORT_9 var_16 = 5; [L46] const SORT_3 var_19 = 2544; [L47] const SORT_9 var_21 = 4; [L48] const SORT_3 var_24 = 9; [L49] const SORT_9 var_26 = 3; [L50] const SORT_3 var_29 = 54; [L51] const SORT_9 var_31 = 2; [L52] const SORT_3 var_34 = 18; [L53] const SORT_9 var_36 = 1; [L54] const SORT_9 var_40 = 0; [L55] const SORT_46 var_47 = 0; [L56] const SORT_46 var_79 = 1; [L57] const SORT_1 var_116 = 1; [L58] const SORT_9 var_159 = 7; [L60] SORT_1 input_2; [L61] SORT_46 input_143; [L62] SORT_46 input_156; [L63] SORT_46 input_167; [L64] SORT_46 input_174; [L65] SORT_46 input_181; [L66] SORT_46 input_188; [L67] SORT_46 input_195; [L68] SORT_46 input_202; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L70] SORT_5 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L71] SORT_46 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L72] SORT_46 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L73] SORT_46 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L74] SORT_46 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L75] SORT_46 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L76] SORT_46 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L77] SORT_46 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L79] SORT_5 init_8_arg_1 = var_6; [L80] state_7 = init_8_arg_1 [L81] SORT_46 init_49_arg_1 = var_47; [L82] state_48 = init_49_arg_1 [L83] SORT_46 init_51_arg_1 = var_47; [L84] state_50 = init_51_arg_1 [L85] SORT_46 init_57_arg_1 = var_47; [L86] state_56 = init_57_arg_1 [L87] SORT_46 init_65_arg_1 = var_47; [L88] state_64 = init_65_arg_1 [L89] SORT_46 init_70_arg_1 = var_47; [L90] state_69 = init_70_arg_1 [L91] SORT_46 init_75_arg_1 = var_47; [L92] state_74 = init_75_arg_1 [L93] SORT_46 init_81_arg_1 = var_79; [L94] state_80 = init_81_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_4=576] [L97] input_2 = __VERIFIER_nondet_uchar() [L98] input_143 = __VERIFIER_nondet_uchar() [L99] input_156 = __VERIFIER_nondet_uchar() [L100] input_167 = __VERIFIER_nondet_uchar() [L101] input_174 = __VERIFIER_nondet_uchar() [L102] input_181 = __VERIFIER_nondet_uchar() [L103] input_188 = __VERIFIER_nondet_uchar() [L104] input_195 = __VERIFIER_nondet_uchar() [L105] input_202 = __VERIFIER_nondet_uchar() [L108] SORT_5 var_39_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_39_arg_0=0, var_40=0, var_4=576] [L109] EXPR var_39_arg_0 & mask_SORT_5 [L109] EXPR var_39_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_4=576] [L109] var_39_arg_0 = var_39_arg_0 & mask_SORT_5 [L110] SORT_9 var_39 = var_39_arg_0; [L111] SORT_9 var_41_arg_0 = var_39; [L112] SORT_9 var_41_arg_1 = var_40; [L113] SORT_1 var_41 = var_41_arg_0 == var_41_arg_1; [L114] SORT_5 var_35_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_35_arg_0=0, var_36=1, var_40=0, var_41=1, var_4=576] [L115] EXPR var_35_arg_0 & mask_SORT_5 [L115] EXPR var_35_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_41=1, var_4=576] [L115] var_35_arg_0 = var_35_arg_0 & mask_SORT_5 [L116] SORT_9 var_35 = var_35_arg_0; [L117] SORT_9 var_37_arg_0 = var_35; [L118] SORT_9 var_37_arg_1 = var_36; [L119] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L120] SORT_5 var_30_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_30_arg_0=0, var_31=2, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L121] EXPR var_30_arg_0 & mask_SORT_5 [L121] EXPR var_30_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L121] var_30_arg_0 = var_30_arg_0 & mask_SORT_5 [L122] SORT_9 var_30 = var_30_arg_0; [L123] SORT_9 var_32_arg_0 = var_30; [L124] SORT_9 var_32_arg_1 = var_31; [L125] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L126] SORT_5 var_25_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_25_arg_0=0, var_26=3, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L127] EXPR var_25_arg_0 & mask_SORT_5 [L127] EXPR var_25_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L127] var_25_arg_0 = var_25_arg_0 & mask_SORT_5 [L128] SORT_9 var_25 = var_25_arg_0; [L129] SORT_9 var_27_arg_0 = var_25; [L130] SORT_9 var_27_arg_1 = var_26; [L131] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L132] SORT_5 var_20_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_20_arg_0=0, var_21=4, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L133] EXPR var_20_arg_0 & mask_SORT_5 [L133] EXPR var_20_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L133] var_20_arg_0 = var_20_arg_0 & mask_SORT_5 [L134] SORT_9 var_20 = var_20_arg_0; [L135] SORT_9 var_22_arg_0 = var_20; [L136] SORT_9 var_22_arg_1 = var_21; [L137] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L138] SORT_5 var_15_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_15_arg_0=0, var_16=5, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L139] EXPR var_15_arg_0 & mask_SORT_5 [L139] EXPR var_15_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L139] var_15_arg_0 = var_15_arg_0 & mask_SORT_5 [L140] SORT_9 var_15 = var_15_arg_0; [L141] SORT_9 var_17_arg_0 = var_15; [L142] SORT_9 var_17_arg_1 = var_16; [L143] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L144] SORT_5 var_10_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_10_arg_0=0, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_17=0, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L145] EXPR var_10_arg_0 & mask_SORT_5 [L145] EXPR var_10_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_17=0, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L145] var_10_arg_0 = var_10_arg_0 & mask_SORT_5 [L146] SORT_9 var_10 = var_10_arg_0; [L147] SORT_9 var_12_arg_0 = var_10; [L148] SORT_9 var_12_arg_1 = var_11; [L149] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L150] SORT_1 var_13_arg_0 = var_12; [L151] SORT_3 var_13_arg_1 = var_4; [L152] SORT_3 var_13_arg_2 = var_4; [L153] SORT_3 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L154] SORT_1 var_18_arg_0 = var_17; [L155] SORT_3 var_18_arg_1 = var_14; [L156] SORT_3 var_18_arg_2 = var_13; [L157] SORT_3 var_18 = var_18_arg_0 ? var_18_arg_1 : var_18_arg_2; [L158] SORT_1 var_23_arg_0 = var_22; [L159] SORT_3 var_23_arg_1 = var_19; [L160] SORT_3 var_23_arg_2 = var_18; [L161] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L162] SORT_1 var_28_arg_0 = var_27; [L163] SORT_3 var_28_arg_1 = var_24; [L164] SORT_3 var_28_arg_2 = var_23; [L165] SORT_3 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; [L166] SORT_1 var_33_arg_0 = var_32; [L167] SORT_3 var_33_arg_1 = var_29; [L168] SORT_3 var_33_arg_2 = var_28; [L169] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L170] SORT_1 var_38_arg_0 = var_37; [L171] SORT_3 var_38_arg_1 = var_34; [L172] SORT_3 var_38_arg_2 = var_33; [L173] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L174] SORT_1 var_42_arg_0 = var_41; [L175] SORT_3 var_42_arg_1 = var_14; [L176] SORT_3 var_42_arg_2 = var_38; [L177] SORT_3 var_42 = var_42_arg_0 ? var_42_arg_1 : var_42_arg_2; [L178] SORT_3 var_43_arg_0 = var_42; [L179] SORT_5 var_43 = var_43_arg_0 >> 0; [L180] SORT_5 var_44_arg_0 = var_43; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_44_arg_0=36, var_4=576] [L181] EXPR var_44_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_44_arg_0=36, var_4=576] [L181] EXPR var_44_arg_0 & mask_SORT_5 [L181] EXPR var_44_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576] [L181] var_44_arg_0 = var_44_arg_0 & mask_SORT_5 [L182] SORT_9 var_44 = var_44_arg_0; [L183] SORT_9 var_45_arg_0 = var_44; [L184] SORT_9 var_45_arg_1 = var_21; [L185] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L186] SORT_3 var_52_arg_0 = var_42; [L187] SORT_5 var_52 = var_52_arg_0 >> 3; [L188] SORT_5 var_82_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_82_arg_0=4] [L189] EXPR var_82_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_82_arg_0=4] [L189] EXPR var_82_arg_0 & mask_SORT_5 [L189] EXPR var_82_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4] [L189] var_82_arg_0 = var_82_arg_0 & mask_SORT_5 [L190] SORT_9 var_82 = var_82_arg_0; [L191] SORT_9 var_83_arg_0 = var_82; [L192] SORT_9 var_83_arg_1 = var_40; [L193] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L194] SORT_5 var_76_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_76_arg_0=4, var_83=0] [L195] EXPR var_76_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_76_arg_0=4, var_83=0] [L195] EXPR var_76_arg_0 & mask_SORT_5 [L195] EXPR var_76_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_83=0] [L195] var_76_arg_0 = var_76_arg_0 & mask_SORT_5 [L196] SORT_9 var_76 = var_76_arg_0; [L197] SORT_9 var_77_arg_0 = var_76; [L198] SORT_9 var_77_arg_1 = var_36; [L199] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L200] SORT_5 var_71_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_71_arg_0=4, var_77=1, var_83=0] [L201] EXPR var_71_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_71_arg_0=4, var_77=1, var_83=0] [L201] EXPR var_71_arg_0 & mask_SORT_5 [L201] EXPR var_71_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_77=1, var_83=0] [L201] var_71_arg_0 = var_71_arg_0 & mask_SORT_5 [L202] SORT_9 var_71 = var_71_arg_0; [L203] SORT_9 var_72_arg_0 = var_71; [L204] SORT_9 var_72_arg_1 = var_31; [L205] SORT_1 var_72 = var_72_arg_0 == var_72_arg_1; [L206] SORT_5 var_66_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_66_arg_0=4, var_72=0, var_77=1, var_83=0] [L207] EXPR var_66_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_66_arg_0=4, var_72=0, var_77=1, var_83=0] [L207] EXPR var_66_arg_0 & mask_SORT_5 [L207] EXPR var_66_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_72=0, var_77=1, var_83=0] [L207] var_66_arg_0 = var_66_arg_0 & mask_SORT_5 [L208] SORT_9 var_66 = var_66_arg_0; [L209] SORT_9 var_67_arg_0 = var_66; [L210] SORT_9 var_67_arg_1 = var_26; [L211] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L212] SORT_5 var_61_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_61_arg_0=4, var_67=1, var_72=0, var_77=1, var_83=0] [L213] EXPR var_61_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_61_arg_0=4, var_67=1, var_72=0, var_77=1, var_83=0] [L213] EXPR var_61_arg_0 & mask_SORT_5 [L213] EXPR var_61_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_67=1, var_72=0, var_77=1, var_83=0] [L213] var_61_arg_0 = var_61_arg_0 & mask_SORT_5 [L214] SORT_9 var_61 = var_61_arg_0; [L215] SORT_9 var_62_arg_0 = var_61; [L216] SORT_9 var_62_arg_1 = var_21; [L217] SORT_1 var_62 = var_62_arg_0 == var_62_arg_1; [L218] SORT_5 var_58_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_58_arg_0=4, var_62=1, var_67=1, var_72=0, var_77=1, var_83=0] [L219] EXPR var_58_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_58_arg_0=4, var_62=1, var_67=1, var_72=0, var_77=1, var_83=0] [L219] EXPR var_58_arg_0 & mask_SORT_5 [L219] EXPR var_58_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_62=1, var_67=1, var_72=0, var_77=1, var_83=0] [L219] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L220] SORT_9 var_58 = var_58_arg_0; [L221] SORT_9 var_59_arg_0 = var_58; [L222] SORT_9 var_59_arg_1 = var_16; [L223] SORT_1 var_59 = var_59_arg_0 == var_59_arg_1; [L224] SORT_5 var_53_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_53_arg_0=4, var_59=0, var_62=1, var_67=1, var_72=0, var_77=1, var_83=0] [L225] EXPR var_53_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_53_arg_0=4, var_59=0, var_62=1, var_67=1, var_72=0, var_77=1, var_83=0] [L225] EXPR var_53_arg_0 & mask_SORT_5 [L225] EXPR var_53_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_59=0, var_62=1, var_67=1, var_72=0, var_77=1, var_83=0] [L225] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L226] SORT_9 var_53 = var_53_arg_0; [L227] SORT_9 var_54_arg_0 = var_53; [L228] SORT_9 var_54_arg_1 = var_11; [L229] SORT_1 var_54 = var_54_arg_0 == var_54_arg_1; [L230] SORT_1 var_55_arg_0 = var_54; [L231] SORT_46 var_55_arg_1 = state_50; [L232] SORT_46 var_55_arg_2 = state_48; [L233] SORT_46 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L234] SORT_1 var_60_arg_0 = var_59; [L235] SORT_46 var_60_arg_1 = state_56; [L236] SORT_46 var_60_arg_2 = var_55; [L237] SORT_46 var_60 = var_60_arg_0 ? var_60_arg_1 : var_60_arg_2; [L238] SORT_1 var_63_arg_0 = var_62; [L239] SORT_46 var_63_arg_1 = state_56; [L240] SORT_46 var_63_arg_2 = var_60; [L241] SORT_46 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L242] SORT_1 var_68_arg_0 = var_67; [L243] SORT_46 var_68_arg_1 = state_64; [L244] SORT_46 var_68_arg_2 = var_63; [L245] SORT_46 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L246] SORT_1 var_73_arg_0 = var_72; [L247] SORT_46 var_73_arg_1 = state_69; [L248] SORT_46 var_73_arg_2 = var_68; [L249] SORT_46 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L250] SORT_1 var_78_arg_0 = var_77; [L251] SORT_46 var_78_arg_1 = state_74; [L252] SORT_46 var_78_arg_2 = var_73; [L253] SORT_46 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L254] SORT_1 var_84_arg_0 = var_83; [L255] SORT_46 var_84_arg_1 = state_80; [L256] SORT_46 var_84_arg_2 = var_78; [L257] SORT_46 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L258] SORT_46 var_85_arg_0 = var_84; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_84=0, var_85_arg_0=0] [L259] EXPR var_85_arg_0 & mask_SORT_46 [L259] EXPR var_85_arg_0 & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_84=0] [L259] var_85_arg_0 = var_85_arg_0 & mask_SORT_46 [L260] SORT_9 var_85 = var_85_arg_0; [L261] SORT_9 var_86_arg_0 = var_85; [L262] SORT_9 var_86_arg_1 = var_40; [L263] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L264] SORT_1 var_87_arg_0 = var_45; [L265] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_87_arg_0=0, var_87_arg_1=1] [L266] EXPR var_87_arg_0 & var_87_arg_1 [L266] EXPR var_87_arg_0 & var_87_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L266] SORT_1 var_87 = var_87_arg_0 & var_87_arg_1; [L267] SORT_1 var_88_arg_0 = var_87; [L268] SORT_1 var_88 = ~var_88_arg_0; [L269] SORT_3 var_89_arg_0 = var_42; [L270] SORT_5 var_89 = var_89_arg_0 >> 6; [L271] SORT_5 var_108_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_108_arg_0=0, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L272] EXPR var_108_arg_0 & mask_SORT_5 [L272] EXPR var_108_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L272] var_108_arg_0 = var_108_arg_0 & mask_SORT_5 [L273] SORT_9 var_108 = var_108_arg_0; [L274] SORT_9 var_109_arg_0 = var_108; [L275] SORT_9 var_109_arg_1 = var_40; [L276] SORT_1 var_109 = var_109_arg_0 == var_109_arg_1; [L277] SORT_5 var_105_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_105_arg_0=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L278] EXPR var_105_arg_0 & mask_SORT_5 [L278] EXPR var_105_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L278] var_105_arg_0 = var_105_arg_0 & mask_SORT_5 [L279] SORT_9 var_105 = var_105_arg_0; [L280] SORT_9 var_106_arg_0 = var_105; [L281] SORT_9 var_106_arg_1 = var_36; [L282] SORT_1 var_106 = var_106_arg_0 == var_106_arg_1; [L283] SORT_5 var_102_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_102_arg_0=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L284] EXPR var_102_arg_0 & mask_SORT_5 [L284] EXPR var_102_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L284] var_102_arg_0 = var_102_arg_0 & mask_SORT_5 [L285] SORT_9 var_102 = var_102_arg_0; [L286] SORT_9 var_103_arg_0 = var_102; [L287] SORT_9 var_103_arg_1 = var_31; [L288] SORT_1 var_103 = var_103_arg_0 == var_103_arg_1; [L289] SORT_5 var_99_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_99_arg_0=0] [L290] EXPR var_99_arg_0 & mask_SORT_5 [L290] EXPR var_99_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L290] var_99_arg_0 = var_99_arg_0 & mask_SORT_5 [L291] SORT_9 var_99 = var_99_arg_0; [L292] SORT_9 var_100_arg_0 = var_99; [L293] SORT_9 var_100_arg_1 = var_26; [L294] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L295] SORT_5 var_96_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_96_arg_0=0] [L296] EXPR var_96_arg_0 & mask_SORT_5 [L296] EXPR var_96_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L296] var_96_arg_0 = var_96_arg_0 & mask_SORT_5 [L297] SORT_9 var_96 = var_96_arg_0; [L298] SORT_9 var_97_arg_0 = var_96; [L299] SORT_9 var_97_arg_1 = var_21; [L300] SORT_1 var_97 = var_97_arg_0 == var_97_arg_1; [L301] SORT_5 var_93_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_93_arg_0=0, var_97=0] [L302] EXPR var_93_arg_0 & mask_SORT_5 [L302] EXPR var_93_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_97=0] [L302] var_93_arg_0 = var_93_arg_0 & mask_SORT_5 [L303] SORT_9 var_93 = var_93_arg_0; [L304] SORT_9 var_94_arg_0 = var_93; [L305] SORT_9 var_94_arg_1 = var_16; [L306] SORT_1 var_94 = var_94_arg_0 == var_94_arg_1; [L307] SORT_5 var_90_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_90_arg_0=0, var_94=0, var_97=0] [L308] EXPR var_90_arg_0 & mask_SORT_5 [L308] EXPR var_90_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_94=0, var_97=0] [L308] var_90_arg_0 = var_90_arg_0 & mask_SORT_5 [L309] SORT_9 var_90 = var_90_arg_0; [L310] SORT_9 var_91_arg_0 = var_90; [L311] SORT_9 var_91_arg_1 = var_11; [L312] SORT_1 var_91 = var_91_arg_0 == var_91_arg_1; [L313] SORT_1 var_92_arg_0 = var_91; [L314] SORT_46 var_92_arg_1 = state_50; [L315] SORT_46 var_92_arg_2 = state_48; [L316] SORT_46 var_92 = var_92_arg_0 ? var_92_arg_1 : var_92_arg_2; [L317] SORT_1 var_95_arg_0 = var_94; [L318] SORT_46 var_95_arg_1 = state_56; [L319] SORT_46 var_95_arg_2 = var_92; [L320] SORT_46 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L321] SORT_1 var_98_arg_0 = var_97; [L322] SORT_46 var_98_arg_1 = state_56; [L323] SORT_46 var_98_arg_2 = var_95; [L324] SORT_46 var_98 = var_98_arg_0 ? var_98_arg_1 : var_98_arg_2; [L325] SORT_1 var_101_arg_0 = var_100; [L326] SORT_46 var_101_arg_1 = state_64; [L327] SORT_46 var_101_arg_2 = var_98; [L328] SORT_46 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L329] SORT_1 var_104_arg_0 = var_103; [L330] SORT_46 var_104_arg_1 = state_69; [L331] SORT_46 var_104_arg_2 = var_101; [L332] SORT_46 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L333] SORT_1 var_107_arg_0 = var_106; [L334] SORT_46 var_107_arg_1 = state_74; [L335] SORT_46 var_107_arg_2 = var_104; [L336] SORT_46 var_107 = var_107_arg_0 ? var_107_arg_1 : var_107_arg_2; [L337] SORT_1 var_110_arg_0 = var_109; [L338] SORT_46 var_110_arg_1 = state_80; [L339] SORT_46 var_110_arg_2 = var_107; [L340] SORT_46 var_110 = var_110_arg_0 ? var_110_arg_1 : var_110_arg_2; [L341] SORT_46 var_111_arg_0 = var_110; [L342] SORT_5 var_111 = var_111_arg_0 >> 0; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1] [L343] EXPR var_111 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1] [L343] EXPR var_111 & mask_SORT_5 [L343] EXPR var_111 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1] [L343] var_111 = var_111 & mask_SORT_5 [L344] SORT_5 var_112_arg_0 = state_7; [L345] SORT_5 var_112_arg_1 = var_111; [L346] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L347] SORT_1 var_113_arg_0 = var_88; [L348] SORT_1 var_113_arg_1 = var_112; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_113_arg_0=-1, var_113_arg_1=0, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L349] EXPR var_113_arg_0 & var_113_arg_1 [L349] EXPR var_113_arg_0 & var_113_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L349] SORT_1 var_113 = var_113_arg_0 & var_113_arg_1; [L350] SORT_1 var_117_arg_0 = var_113; [L351] SORT_1 var_117 = ~var_117_arg_0; [L352] SORT_1 var_118_arg_0 = var_116; [L353] SORT_1 var_118_arg_1 = var_117; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_118_arg_0=1, var_118_arg_1=-1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L354] EXPR var_118_arg_0 & var_118_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_118_arg_0=1, var_118_arg_1=-1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L354] EXPR var_118_arg_0 & var_118_arg_1 [L354] EXPR var_118_arg_0 & var_118_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L354] SORT_1 var_118 = var_118_arg_0 & var_118_arg_1; [L355] EXPR var_118 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_118=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L355] EXPR var_118 & mask_SORT_1 [L355] EXPR var_118 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L355] var_118 = var_118 & mask_SORT_1 [L356] SORT_1 bad_119_arg_0 = var_118; VAL [bad_119_arg_0=1, mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L357] CALL __VERIFIER_assert(!(bad_119_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, 212 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 87.9s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 39.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14493 SdHoareTripleChecker+Valid, 29.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14463 mSDsluCounter, 49053 SdHoareTripleChecker+Invalid, 25.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40421 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36512 IncrementalHoareTripleChecker+Invalid, 36613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 8632 mSDtfsCounter, 36512 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 584 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=810occurred in iteration=38, InterpolantAutomatonStates: 326, 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, 38 MinimizatonAttempts, 3304 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 3514 NumberOfCodeBlocks, 3514 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3382 ConstructedInterpolants, 0 QuantifiedInterpolants, 28402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-08-14 14:28:42,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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.v_non-pipelined-microprocessor.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.v_non-pipelined-microprocessor.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:28:44,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:28:44,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-14 14:28:44,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:28:44,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:28:44,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:28:44,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:28:44,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:28:44,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:28:44,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:28:44,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:28:44,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:28:44,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:28:44,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:28:44,284 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:28:44,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:28:44,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:28:44,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:28:44,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:28:44,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:28:44,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:28:44,292 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:28:44,292 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:28:44,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:28:44,293 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:28:44,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:28:44,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:28:44,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:28:44,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:28:44,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:28:44,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:28:44,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:28:44,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:28:44,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:28:44,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:28:44,296 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:28:44,297 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:28:44,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:28:44,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:28:44,297 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:28:44,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:28:44,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:28:44,298 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:28:44,298 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:28:44,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:28:44,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:28:44,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:28:44,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:28:44,578 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:28:44,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-08-14 14:28:45,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:28:46,140 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:28:46,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-08-14 14:28:46,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c2c9e549/318182c6ab7e46d9a74767046d864233/FLAGb10468700 [2024-08-14 14:28:46,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c2c9e549/318182c6ab7e46d9a74767046d864233 [2024-08-14 14:28:46,183 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:28:46,184 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:28:46,185 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.v_non-pipelined-microprocessor.yml/witness.yml [2024-08-14 14:28:46,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:28:46,239 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:28:46,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:28:46,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:28:46,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:28:46,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:28:46" (1/2) ... [2024-08-14 14:28:46,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6390ecc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:28:46, skipping insertion in model container [2024-08-14 14:28:46,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:28:46" (1/2) ... [2024-08-14 14:28:46,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@26c208e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:28:46, skipping insertion in model container [2024-08-14 14:28:46,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:28:46" (2/2) ... [2024-08-14 14:28:46,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6390ecc1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46, skipping insertion in model container [2024-08-14 14:28:46,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:28:46" (2/2) ... [2024-08-14 14:28:46,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:28:46,437 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.v_non-pipelined-microprocessor.c[1270,1283] [2024-08-14 14:28:46,552 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:28:46,566 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:28:46,576 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.v_non-pipelined-microprocessor.c[1270,1283] [2024-08-14 14:28:46,689 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:28:46,702 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:28:46,703 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46 WrapperNode [2024-08-14 14:28:46,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:28:46,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:28:46,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:28:46,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:28:46,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46" (1/1) ... [2024-08-14 14:28:46,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46" (1/1) ... [2024-08-14 14:28:46,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46" (1/1) ... [2024-08-14 14:28:46,767 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:28:46,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46" (1/1) ... [2024-08-14 14:28:46,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46" (1/1) ... [2024-08-14 14:28:46,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46" (1/1) ... [2024-08-14 14:28:46,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46" (1/1) ... [2024-08-14 14:28:46,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46" (1/1) ... [2024-08-14 14:28:46,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:28:46,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:28:46,803 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:28:46,804 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:28:46,804 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46" (1/1) ... [2024-08-14 14:28:46,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:28:46,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:46,837 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:28:46,840 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:28:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:28:46,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:28:46,878 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:28:46,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:28:46,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:28:46,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:28:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:28:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:28:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:28:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:28:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:28:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:28:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:28:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:28:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:28:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:28:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:28:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:28:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:28:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:28:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:28:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:28:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:28:47,029 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:28:47,031 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:28:47,607 INFO L? ?]: Removed 247 outVars from TransFormulas that were not future-live. [2024-08-14 14:28:47,607 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:28:47,617 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:28:47,617 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:28:47,617 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:28:47 BoogieIcfgContainer [2024-08-14 14:28:47,618 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:28:47,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:28:47,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:28:47,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:28:47,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:28:46" (1/4) ... [2024-08-14 14:28:47,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733c1568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:28:47, skipping insertion in model container [2024-08-14 14:28:47,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:28:46" (2/4) ... [2024-08-14 14:28:47,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733c1568 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:28:47, skipping insertion in model container [2024-08-14 14:28:47,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:46" (3/4) ... [2024-08-14 14:28:47,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733c1568 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:28:47, skipping insertion in model container [2024-08-14 14:28:47,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:28:47" (4/4) ... [2024-08-14 14:28:47,624 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-08-14 14:28:47,624 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:28:47,653 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:28:47,654 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:28:47,675 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [3] [2024-08-14 14:28:47,682 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:28:47,705 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 41 states to 26 states. [2024-08-14 14:28:47,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:28:47,723 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;@7832eb9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:28:47,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:28:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2024-08-14 14:28:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-08-14 14:28:47,727 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:47,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:47,728 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:47,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1024331893, now seen corresponding path program 1 times [2024-08-14 14:28:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:28:47,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261974386] [2024-08-14 14:28:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:47,743 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:28:47,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:28:47,745 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:28:47,747 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:28:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:28:47,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:28:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:28:48,049 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:28:48,050 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:28:48,051 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:28:48,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-08-14 14:28:48,253 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:28:48,257 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:28:48,260 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:28:48,291 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:28:48 BoogieIcfgContainer [2024-08-14 14:28:48,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:28:48,293 INFO L158 Benchmark]: Toolchain (without parser) took 2055.63ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 61.6MB in the beginning and 77.2MB in the end (delta: -15.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-08-14 14:28:48,294 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory is still 29.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:28:48,294 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:28:48,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.48ms. Allocated memory is still 88.1MB. Free memory was 61.3MB in the beginning and 58.0MB in the end (delta: 3.3MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-08-14 14:28:48,295 INFO L158 Benchmark]: Boogie Preprocessor took 99.47ms. Allocated memory is still 88.1MB. Free memory was 58.0MB in the beginning and 52.1MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-08-14 14:28:48,296 INFO L158 Benchmark]: IcfgBuilder took 814.34ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 52.1MB in the beginning and 76.1MB in the end (delta: -24.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2024-08-14 14:28:48,296 INFO L158 Benchmark]: TraceAbstraction took 673.39ms. Allocated memory is still 113.2MB. Free memory was 75.4MB in the beginning and 77.2MB in the end (delta: -1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:28:48,298 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory is still 29.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.48ms. Allocated memory is still 88.1MB. Free memory was 61.3MB in the beginning and 58.0MB in the end (delta: 3.3MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.47ms. Allocated memory is still 88.1MB. Free memory was 58.0MB in the beginning and 52.1MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 814.34ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 52.1MB in the beginning and 76.1MB in the end (delta: -24.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 673.39ms. Allocated memory is still 113.2MB. Free memory was 75.4MB in the beginning and 77.2MB in the end (delta: -1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 12); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (12 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L35] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 32); [L36] const SORT_9 msb_SORT_9 = (SORT_9)1 << (32 - 1); [L38] const SORT_46 mask_SORT_46 = (SORT_46)-1 >> (sizeof(SORT_46) * 8 - 5); [L39] const SORT_46 msb_SORT_46 = (SORT_46)1 << (5 - 1); [L41] const SORT_3 var_4 = 576; [L42] const SORT_5 var_6 = 0; [L43] const SORT_9 var_11 = 6; [L44] const SORT_3 var_14 = 36; [L45] const SORT_9 var_16 = 5; [L46] const SORT_3 var_19 = 2544; [L47] const SORT_9 var_21 = 4; [L48] const SORT_3 var_24 = 9; [L49] const SORT_9 var_26 = 3; [L50] const SORT_3 var_29 = 54; [L51] const SORT_9 var_31 = 2; [L52] const SORT_3 var_34 = 18; [L53] const SORT_9 var_36 = 1; [L54] const SORT_9 var_40 = 0; [L55] const SORT_46 var_47 = 0; [L56] const SORT_46 var_79 = 1; [L57] const SORT_1 var_116 = 1; [L58] const SORT_9 var_159 = 7; [L60] SORT_1 input_2; [L61] SORT_46 input_143; [L62] SORT_46 input_156; [L63] SORT_46 input_167; [L64] SORT_46 input_174; [L65] SORT_46 input_181; [L66] SORT_46 input_188; [L67] SORT_46 input_195; [L68] SORT_46 input_202; [L70] SORT_5 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L71] SORT_46 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L72] SORT_46 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L73] SORT_46 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L74] SORT_46 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L75] SORT_46 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L76] SORT_46 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L77] SORT_46 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L79] SORT_5 init_8_arg_1 = var_6; [L80] state_7 = init_8_arg_1 [L81] SORT_46 init_49_arg_1 = var_47; [L82] state_48 = init_49_arg_1 [L83] SORT_46 init_51_arg_1 = var_47; [L84] state_50 = init_51_arg_1 [L85] SORT_46 init_57_arg_1 = var_47; [L86] state_56 = init_57_arg_1 [L87] SORT_46 init_65_arg_1 = var_47; [L88] state_64 = init_65_arg_1 [L89] SORT_46 init_70_arg_1 = var_47; [L90] state_69 = init_70_arg_1 [L91] SORT_46 init_75_arg_1 = var_47; [L92] state_74 = init_75_arg_1 [L93] SORT_46 init_81_arg_1 = var_79; [L94] state_80 = init_81_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_4=576] [L97] input_2 = __VERIFIER_nondet_uchar() [L98] input_143 = __VERIFIER_nondet_uchar() [L99] input_156 = __VERIFIER_nondet_uchar() [L100] input_167 = __VERIFIER_nondet_uchar() [L101] input_174 = __VERIFIER_nondet_uchar() [L102] input_181 = __VERIFIER_nondet_uchar() [L103] input_188 = __VERIFIER_nondet_uchar() [L104] input_195 = __VERIFIER_nondet_uchar() [L105] input_202 = __VERIFIER_nondet_uchar() [L108] SORT_5 var_39_arg_0 = state_7; [L109] var_39_arg_0 = var_39_arg_0 & mask_SORT_5 [L110] SORT_9 var_39 = var_39_arg_0; [L111] SORT_9 var_41_arg_0 = var_39; [L112] SORT_9 var_41_arg_1 = var_40; [L113] SORT_1 var_41 = var_41_arg_0 == var_41_arg_1; [L114] SORT_5 var_35_arg_0 = state_7; [L115] var_35_arg_0 = var_35_arg_0 & mask_SORT_5 [L116] SORT_9 var_35 = var_35_arg_0; [L117] SORT_9 var_37_arg_0 = var_35; [L118] SORT_9 var_37_arg_1 = var_36; [L119] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L120] SORT_5 var_30_arg_0 = state_7; [L121] var_30_arg_0 = var_30_arg_0 & mask_SORT_5 [L122] SORT_9 var_30 = var_30_arg_0; [L123] SORT_9 var_32_arg_0 = var_30; [L124] SORT_9 var_32_arg_1 = var_31; [L125] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L126] SORT_5 var_25_arg_0 = state_7; [L127] var_25_arg_0 = var_25_arg_0 & mask_SORT_5 [L128] SORT_9 var_25 = var_25_arg_0; [L129] SORT_9 var_27_arg_0 = var_25; [L130] SORT_9 var_27_arg_1 = var_26; [L131] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L132] SORT_5 var_20_arg_0 = state_7; [L133] var_20_arg_0 = var_20_arg_0 & mask_SORT_5 [L134] SORT_9 var_20 = var_20_arg_0; [L135] SORT_9 var_22_arg_0 = var_20; [L136] SORT_9 var_22_arg_1 = var_21; [L137] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L138] SORT_5 var_15_arg_0 = state_7; [L139] var_15_arg_0 = var_15_arg_0 & mask_SORT_5 [L140] SORT_9 var_15 = var_15_arg_0; [L141] SORT_9 var_17_arg_0 = var_15; [L142] SORT_9 var_17_arg_1 = var_16; [L143] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L144] SORT_5 var_10_arg_0 = state_7; [L145] var_10_arg_0 = var_10_arg_0 & mask_SORT_5 [L146] SORT_9 var_10 = var_10_arg_0; [L147] SORT_9 var_12_arg_0 = var_10; [L148] SORT_9 var_12_arg_1 = var_11; [L149] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L150] SORT_1 var_13_arg_0 = var_12; [L151] SORT_3 var_13_arg_1 = var_4; [L152] SORT_3 var_13_arg_2 = var_4; [L153] SORT_3 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L154] SORT_1 var_18_arg_0 = var_17; [L155] SORT_3 var_18_arg_1 = var_14; [L156] SORT_3 var_18_arg_2 = var_13; [L157] SORT_3 var_18 = var_18_arg_0 ? var_18_arg_1 : var_18_arg_2; [L158] SORT_1 var_23_arg_0 = var_22; [L159] SORT_3 var_23_arg_1 = var_19; [L160] SORT_3 var_23_arg_2 = var_18; [L161] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L162] SORT_1 var_28_arg_0 = var_27; [L163] SORT_3 var_28_arg_1 = var_24; [L164] SORT_3 var_28_arg_2 = var_23; [L165] SORT_3 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; [L166] SORT_1 var_33_arg_0 = var_32; [L167] SORT_3 var_33_arg_1 = var_29; [L168] SORT_3 var_33_arg_2 = var_28; [L169] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L170] SORT_1 var_38_arg_0 = var_37; [L171] SORT_3 var_38_arg_1 = var_34; [L172] SORT_3 var_38_arg_2 = var_33; [L173] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L174] SORT_1 var_42_arg_0 = var_41; [L175] SORT_3 var_42_arg_1 = var_14; [L176] SORT_3 var_42_arg_2 = var_38; [L177] SORT_3 var_42 = var_42_arg_0 ? var_42_arg_1 : var_42_arg_2; [L178] SORT_3 var_43_arg_0 = var_42; [L179] SORT_5 var_43 = var_43_arg_0 >> 0; [L180] SORT_5 var_44_arg_0 = var_43; [L181] var_44_arg_0 = var_44_arg_0 & mask_SORT_5 [L182] SORT_9 var_44 = var_44_arg_0; [L183] SORT_9 var_45_arg_0 = var_44; [L184] SORT_9 var_45_arg_1 = var_21; [L185] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L186] SORT_3 var_52_arg_0 = var_42; [L187] SORT_5 var_52 = var_52_arg_0 >> 3; [L188] SORT_5 var_82_arg_0 = var_52; [L189] var_82_arg_0 = var_82_arg_0 & mask_SORT_5 [L190] SORT_9 var_82 = var_82_arg_0; [L191] SORT_9 var_83_arg_0 = var_82; [L192] SORT_9 var_83_arg_1 = var_40; [L193] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L194] SORT_5 var_76_arg_0 = var_52; [L195] var_76_arg_0 = var_76_arg_0 & mask_SORT_5 [L196] SORT_9 var_76 = var_76_arg_0; [L197] SORT_9 var_77_arg_0 = var_76; [L198] SORT_9 var_77_arg_1 = var_36; [L199] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L200] SORT_5 var_71_arg_0 = var_52; [L201] var_71_arg_0 = var_71_arg_0 & mask_SORT_5 [L202] SORT_9 var_71 = var_71_arg_0; [L203] SORT_9 var_72_arg_0 = var_71; [L204] SORT_9 var_72_arg_1 = var_31; [L205] SORT_1 var_72 = var_72_arg_0 == var_72_arg_1; [L206] SORT_5 var_66_arg_0 = var_52; [L207] var_66_arg_0 = var_66_arg_0 & mask_SORT_5 [L208] SORT_9 var_66 = var_66_arg_0; [L209] SORT_9 var_67_arg_0 = var_66; [L210] SORT_9 var_67_arg_1 = var_26; [L211] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L212] SORT_5 var_61_arg_0 = var_52; [L213] var_61_arg_0 = var_61_arg_0 & mask_SORT_5 [L214] SORT_9 var_61 = var_61_arg_0; [L215] SORT_9 var_62_arg_0 = var_61; [L216] SORT_9 var_62_arg_1 = var_21; [L217] SORT_1 var_62 = var_62_arg_0 == var_62_arg_1; [L218] SORT_5 var_58_arg_0 = var_52; [L219] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L220] SORT_9 var_58 = var_58_arg_0; [L221] SORT_9 var_59_arg_0 = var_58; [L222] SORT_9 var_59_arg_1 = var_16; [L223] SORT_1 var_59 = var_59_arg_0 == var_59_arg_1; [L224] SORT_5 var_53_arg_0 = var_52; [L225] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L226] SORT_9 var_53 = var_53_arg_0; [L227] SORT_9 var_54_arg_0 = var_53; [L228] SORT_9 var_54_arg_1 = var_11; [L229] SORT_1 var_54 = var_54_arg_0 == var_54_arg_1; [L230] SORT_1 var_55_arg_0 = var_54; [L231] SORT_46 var_55_arg_1 = state_50; [L232] SORT_46 var_55_arg_2 = state_48; [L233] SORT_46 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L234] SORT_1 var_60_arg_0 = var_59; [L235] SORT_46 var_60_arg_1 = state_56; [L236] SORT_46 var_60_arg_2 = var_55; [L237] SORT_46 var_60 = var_60_arg_0 ? var_60_arg_1 : var_60_arg_2; [L238] SORT_1 var_63_arg_0 = var_62; [L239] SORT_46 var_63_arg_1 = state_56; [L240] SORT_46 var_63_arg_2 = var_60; [L241] SORT_46 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L242] SORT_1 var_68_arg_0 = var_67; [L243] SORT_46 var_68_arg_1 = state_64; [L244] SORT_46 var_68_arg_2 = var_63; [L245] SORT_46 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L246] SORT_1 var_73_arg_0 = var_72; [L247] SORT_46 var_73_arg_1 = state_69; [L248] SORT_46 var_73_arg_2 = var_68; [L249] SORT_46 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L250] SORT_1 var_78_arg_0 = var_77; [L251] SORT_46 var_78_arg_1 = state_74; [L252] SORT_46 var_78_arg_2 = var_73; [L253] SORT_46 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L254] SORT_1 var_84_arg_0 = var_83; [L255] SORT_46 var_84_arg_1 = state_80; [L256] SORT_46 var_84_arg_2 = var_78; [L257] SORT_46 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L258] SORT_46 var_85_arg_0 = var_84; [L259] var_85_arg_0 = var_85_arg_0 & mask_SORT_46 [L260] SORT_9 var_85 = var_85_arg_0; [L261] SORT_9 var_86_arg_0 = var_85; [L262] SORT_9 var_86_arg_1 = var_40; [L263] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L264] SORT_1 var_87_arg_0 = var_45; [L265] SORT_1 var_87_arg_1 = var_86; [L266] SORT_1 var_87 = var_87_arg_0 & var_87_arg_1; [L267] SORT_1 var_88_arg_0 = var_87; [L268] SORT_1 var_88 = ~var_88_arg_0; [L269] SORT_3 var_89_arg_0 = var_42; [L270] SORT_5 var_89 = var_89_arg_0 >> 6; [L271] SORT_5 var_108_arg_0 = var_89; [L272] var_108_arg_0 = var_108_arg_0 & mask_SORT_5 [L273] SORT_9 var_108 = var_108_arg_0; [L274] SORT_9 var_109_arg_0 = var_108; [L275] SORT_9 var_109_arg_1 = var_40; [L276] SORT_1 var_109 = var_109_arg_0 == var_109_arg_1; [L277] SORT_5 var_105_arg_0 = var_89; [L278] var_105_arg_0 = var_105_arg_0 & mask_SORT_5 [L279] SORT_9 var_105 = var_105_arg_0; [L280] SORT_9 var_106_arg_0 = var_105; [L281] SORT_9 var_106_arg_1 = var_36; [L282] SORT_1 var_106 = var_106_arg_0 == var_106_arg_1; [L283] SORT_5 var_102_arg_0 = var_89; [L284] var_102_arg_0 = var_102_arg_0 & mask_SORT_5 [L285] SORT_9 var_102 = var_102_arg_0; [L286] SORT_9 var_103_arg_0 = var_102; [L287] SORT_9 var_103_arg_1 = var_31; [L288] SORT_1 var_103 = var_103_arg_0 == var_103_arg_1; [L289] SORT_5 var_99_arg_0 = var_89; [L290] var_99_arg_0 = var_99_arg_0 & mask_SORT_5 [L291] SORT_9 var_99 = var_99_arg_0; [L292] SORT_9 var_100_arg_0 = var_99; [L293] SORT_9 var_100_arg_1 = var_26; [L294] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L295] SORT_5 var_96_arg_0 = var_89; [L296] var_96_arg_0 = var_96_arg_0 & mask_SORT_5 [L297] SORT_9 var_96 = var_96_arg_0; [L298] SORT_9 var_97_arg_0 = var_96; [L299] SORT_9 var_97_arg_1 = var_21; [L300] SORT_1 var_97 = var_97_arg_0 == var_97_arg_1; [L301] SORT_5 var_93_arg_0 = var_89; [L302] var_93_arg_0 = var_93_arg_0 & mask_SORT_5 [L303] SORT_9 var_93 = var_93_arg_0; [L304] SORT_9 var_94_arg_0 = var_93; [L305] SORT_9 var_94_arg_1 = var_16; [L306] SORT_1 var_94 = var_94_arg_0 == var_94_arg_1; [L307] SORT_5 var_90_arg_0 = var_89; [L308] var_90_arg_0 = var_90_arg_0 & mask_SORT_5 [L309] SORT_9 var_90 = var_90_arg_0; [L310] SORT_9 var_91_arg_0 = var_90; [L311] SORT_9 var_91_arg_1 = var_11; [L312] SORT_1 var_91 = var_91_arg_0 == var_91_arg_1; [L313] SORT_1 var_92_arg_0 = var_91; [L314] SORT_46 var_92_arg_1 = state_50; [L315] SORT_46 var_92_arg_2 = state_48; [L316] SORT_46 var_92 = var_92_arg_0 ? var_92_arg_1 : var_92_arg_2; [L317] SORT_1 var_95_arg_0 = var_94; [L318] SORT_46 var_95_arg_1 = state_56; [L319] SORT_46 var_95_arg_2 = var_92; [L320] SORT_46 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L321] SORT_1 var_98_arg_0 = var_97; [L322] SORT_46 var_98_arg_1 = state_56; [L323] SORT_46 var_98_arg_2 = var_95; [L324] SORT_46 var_98 = var_98_arg_0 ? var_98_arg_1 : var_98_arg_2; [L325] SORT_1 var_101_arg_0 = var_100; [L326] SORT_46 var_101_arg_1 = state_64; [L327] SORT_46 var_101_arg_2 = var_98; [L328] SORT_46 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L329] SORT_1 var_104_arg_0 = var_103; [L330] SORT_46 var_104_arg_1 = state_69; [L331] SORT_46 var_104_arg_2 = var_101; [L332] SORT_46 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L333] SORT_1 var_107_arg_0 = var_106; [L334] SORT_46 var_107_arg_1 = state_74; [L335] SORT_46 var_107_arg_2 = var_104; [L336] SORT_46 var_107 = var_107_arg_0 ? var_107_arg_1 : var_107_arg_2; [L337] SORT_1 var_110_arg_0 = var_109; [L338] SORT_46 var_110_arg_1 = state_80; [L339] SORT_46 var_110_arg_2 = var_107; [L340] SORT_46 var_110 = var_110_arg_0 ? var_110_arg_1 : var_110_arg_2; [L341] SORT_46 var_111_arg_0 = var_110; [L342] SORT_5 var_111 = var_111_arg_0 >> 0; [L343] var_111 = var_111 & mask_SORT_5 [L344] SORT_5 var_112_arg_0 = state_7; [L345] SORT_5 var_112_arg_1 = var_111; [L346] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L347] SORT_1 var_113_arg_0 = var_88; [L348] SORT_1 var_113_arg_1 = var_112; [L349] SORT_1 var_113 = var_113_arg_0 & var_113_arg_1; [L350] SORT_1 var_117_arg_0 = var_113; [L351] SORT_1 var_117 = ~var_117_arg_0; [L352] SORT_1 var_118_arg_0 = var_116; [L353] SORT_1 var_118_arg_1 = var_117; [L354] SORT_1 var_118 = var_118_arg_0 & var_118_arg_1; [L355] var_118 = var_118 & mask_SORT_1 [L356] SORT_1 bad_119_arg_0 = var_118; VAL [bad_119_arg_0=1, mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L357] CALL __VERIFIER_assert(!(bad_119_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: 0.6s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 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:28:48,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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