./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.mul5.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.mul5.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.mul5.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:25:36,619 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-08-14 14:25:36,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2024-08-14 14:25:36,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-08-14 14:25:36,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-08-14 14:25:36,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-08-14 14:25:36,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-08-14 14:25:36,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-08-14 14:25:36,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-08-14 14:25:36,724 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-08-14 14:25:36,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-08-14 14:25:36,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-08-14 14:25:36,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-08-14 14:25:36,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-08-14 14:25:36,726 INFO L153 SettingsManager]: * Use SBE=true
[2024-08-14 14:25:36,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-08-14 14:25:36,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-08-14 14:25:36,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-08-14 14:25:36,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-08-14 14:25:36,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-08-14 14:25:36,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-08-14 14:25:36,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-08-14 14:25:36,729 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-08-14 14:25:36,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-08-14 14:25:36,729 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-08-14 14:25:36,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-08-14 14:25:36,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-08-14 14:25:36,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-08-14 14:25:36,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-08-14 14:25:36,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-08-14 14:25:36,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-08-14 14:25:36,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-08-14 14:25:36,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-08-14 14:25:36,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-08-14 14:25:36,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-08-14 14:25:36,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-08-14 14:25:36,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-08-14 14:25:36,731 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-08-14 14:25:36,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-08-14 14:25:36,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-08-14 14:25:36,731 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements
[2024-08-14 14:25:36,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-08-14 14:25:36,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-08-14 14:25:36,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-08-14 14:25:36,952 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-08-14 14:25:36,952 INFO L274 PluginConnector]: CDTParser initialized
[2024-08-14 14:25:36,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c
[2024-08-14 14:25:38,270 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-08-14 14:25:38,440 INFO L384 CDTParser]: Found 1 translation units.
[2024-08-14 14:25:38,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c
[2024-08-14 14:25:38,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8b5bcfa/6871407fe10642ac903a9a9d8dd68b26/FLAGa7c6b3f5f
[2024-08-14 14:25:38,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8b5bcfa/6871407fe10642ac903a9a9d8dd68b26
[2024-08-14 14:25:38,838 INFO L270 PluginConnector]: Initializing Witness Parser...
[2024-08-14 14:25:38,840 INFO L274 PluginConnector]: Witness Parser initialized
[2024-08-14 14:25:38,841 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.mul5.yml/witness.yml
[2024-08-14 14:25:38,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-08-14 14:25:38,900 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements.
[2024-08-14 14:25:38,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-08-14 14:25:38,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-08-14 14:25:38,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-08-14 14:25:38,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:25:38" (1/2) ...
[2024-08-14 14:25:38,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d2914f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:38, skipping insertion in model container
[2024-08-14 14:25:38,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:25:38" (1/2) ...
[2024-08-14 14:25:38,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4c0d205b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:38, skipping insertion in model container
[2024-08-14 14:25:38,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:25:38" (2/2) ...
[2024-08-14 14:25:38,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d2914f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:38, skipping insertion in model container
[2024-08-14 14:25:38,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:25:38" (2/2) ...
[2024-08-14 14:25:38,931 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-08-14 14:25:39,051 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.mul5.c[1244,1257]
[2024-08-14 14:25:39,105 INFO L207 PostProcessor]: Analyzing one entry point: main
[2024-08-14 14:25:39,115 INFO L200 MainTranslator]: Completed pre-run
[2024-08-14 14:25:39,128 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.mul5.c[1244,1257]
[2024-08-14 14:25:39,185 INFO L207 PostProcessor]: Analyzing one entry point: main
[2024-08-14 14:25:39,203 INFO L204 MainTranslator]: Completed translation
[2024-08-14 14:25:39,203 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39 WrapperNode
[2024-08-14 14:25:39,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-08-14 14:25:39,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-08-14 14:25:39,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-08-14 14:25:39,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-08-14 14:25:39,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39" (1/1) ...
[2024-08-14 14:25:39,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39" (1/1) ...
[2024-08-14 14:25:39,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39" (1/1) ...
[2024-08-14 14:25:39,249 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0].
[2024-08-14 14:25:39,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39" (1/1) ...
[2024-08-14 14:25:39,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39" (1/1) ...
[2024-08-14 14:25:39,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39" (1/1) ...
[2024-08-14 14:25:39,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39" (1/1) ...
[2024-08-14 14:25:39,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39" (1/1) ...
[2024-08-14 14:25:39,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-08-14 14:25:39,282 INFO L112 PluginConnector]: ------------------------IcfgBuilder----------------------------
[2024-08-14 14:25:39,282 INFO L270 PluginConnector]: Initializing IcfgBuilder...
[2024-08-14 14:25:39,282 INFO L274 PluginConnector]: IcfgBuilder initialized
[2024-08-14 14:25:39,283 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39" (1/1) ...
[2024-08-14 14:25:39,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-08-14 14:25:39,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-08-14 14:25:39,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-08-14 14:25:39,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-08-14 14:25:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2024-08-14 14:25:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-08-14 14:25:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2024-08-14 14:25:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2024-08-14 14:25:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-08-14 14:25:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2024-08-14 14:25:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar
[2024-08-14 14:25:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort
[2024-08-14 14:25:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2024-08-14 14:25:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong
[2024-08-14 14:25:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2024-08-14 14:25:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2024-08-14 14:25:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2024-08-14 14:25:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-08-14 14:25:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2024-08-14 14:25:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-08-14 14:25:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2024-08-14 14:25:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2024-08-14 14:25:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-08-14 14:25:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-08-14 14:25:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-08-14 14:25:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-08-14 14:25:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-08-14 14:25:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-08-14 14:25:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-08-14 14:25:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-08-14 14:25:39,445 INFO L273 CfgBuilder]: Building ICFG
[2024-08-14 14:25:39,447 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-08-14 14:25:39,984 INFO L? ?]: Removed 208 outVars from TransFormulas that were not future-live.
[2024-08-14 14:25:39,984 INFO L327 CfgBuilder]: Performing block encoding
[2024-08-14 14:25:39,992 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-08-14 14:25:39,992 INFO L354 CfgBuilder]: Removed 0 assume(true) statements.
[2024-08-14 14:25:39,993 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:25:39 BoogieIcfgContainer
[2024-08-14 14:25:39,993 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2024-08-14 14:25:39,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-08-14 14:25:39,994 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-08-14 14:25:39,997 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-08-14 14:25:39,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:25:38" (1/4) ...
[2024-08-14 14:25:39,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e944bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:25:39, skipping insertion in model container
[2024-08-14 14:25:39,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:25:38" (2/4) ...
[2024-08-14 14:25:39,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e944bfb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:25:39, skipping insertion in model container
[2024-08-14 14:25:39,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:39" (3/4) ...
[2024-08-14 14:25:39,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e944bfb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:25:39, skipping insertion in model container
[2024-08-14 14:25:40,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:25:39" (4/4) ...
[2024-08-14 14:25:40,001 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul5.c
[2024-08-14 14:25:40,001 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness
[2024-08-14 14:25:40,018 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-08-14 14:25:40,019 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-08-14 14:25:40,049 INFO L92 WitnessUtils]: Constructing product of automaton with 114 states and violation witness of the following lengths: [9]
[2024-08-14 14:25:40,056 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 114 states, 106 states have (on average 1.6132075471698113) internal successors, (171), 107 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-08-14 14:25:40,218 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 520 states to 483 states.
[2024-08-14 14:25:40,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-08-14 14:25:40,244 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;@4dbdd92a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-08-14 14:25:40,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-08-14 14:25:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states.
[2024-08-14 14:25:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2024-08-14 14:25:40,259 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:40,260 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:25:40,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:40,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1228237153, now seen corresponding path program 1 times
[2024-08-14 14:25:40,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:40,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166408362]
[2024-08-14 14:25:40,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:40,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2024-08-14 14:25:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-08-14 14:25:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2024-08-14 14:25:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166408362]
[2024-08-14 14:25:41,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166408362] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 14:25:41,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 14:25:41,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-08-14 14:25:41,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204771496]
[2024-08-14 14:25:41,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 14:25:41,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-08-14 14:25:41,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-08-14 14:25:41,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-08-14 14:25:41,358 INFO L87 Difference]: Start difference. First operand 483 states. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-08-14 14:25:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:41,438 INFO L93 Difference]: Finished difference Result 422 states and 668 transitions.
[2024-08-14 14:25:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-08-14 14:25:41,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 143
[2024-08-14 14:25:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:41,443 INFO L225 Difference]: With dead ends: 422
[2024-08-14 14:25:41,443 INFO L226 Difference]: Without dead ends: 420
[2024-08-14 14:25:41,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:25:41,449 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 73 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 826 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:25:41,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 826 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-08-14 14:25:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states.
[2024-08-14 14:25:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 205.
[2024-08-14 14:25:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 195 states have (on average 1.6102564102564103) internal successors, (314), 196 states have internal predecessors, (314), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)
[2024-08-14 14:25:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 323 transitions.
[2024-08-14 14:25:41,501 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 323 transitions. Word has length 143
[2024-08-14 14:25:41,502 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:41,502 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 323 transitions.
[2024-08-14 14:25:41,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-08-14 14:25:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 323 transitions.
[2024-08-14 14:25:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2024-08-14 14:25:41,503 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:41,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:25:41,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-08-14 14:25:41,504 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:41,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2047201513, now seen corresponding path program 1 times
[2024-08-14 14:25:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:41,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193425500]
[2024-08-14 14:25:41,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:41,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:41,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:41,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2024-08-14 14:25:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-08-14 14:25:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked.
[2024-08-14 14:25:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193425500]
[2024-08-14 14:25:41,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193425500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 14:25:41,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 14:25:41,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-08-14 14:25:41,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949840363]
[2024-08-14 14:25:41,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 14:25:41,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-08-14 14:25:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-08-14 14:25:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-08-14 14:25:41,967 INFO L87 Difference]: Start difference. First operand 205 states and 323 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-08-14 14:25:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:41,988 INFO L93 Difference]: Finished difference Result 211 states and 329 transitions.
[2024-08-14 14:25:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-08-14 14:25:41,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 144
[2024-08-14 14:25:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:41,991 INFO L225 Difference]: With dead ends: 211
[2024-08-14 14:25:41,991 INFO L226 Difference]: Without dead ends: 211
[2024-08-14 14:25:41,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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:25:41,993 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 497 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:25:41,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 497 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-08-14 14:25:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2024-08-14 14:25:42,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209.
[2024-08-14 14:25:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.5979899497487438) internal successors, (318), 200 states have internal predecessors, (318), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)
[2024-08-14 14:25:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 327 transitions.
[2024-08-14 14:25:42,012 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 327 transitions. Word has length 144
[2024-08-14 14:25:42,013 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:42,013 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 327 transitions.
[2024-08-14 14:25:42,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-08-14 14:25:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 327 transitions.
[2024-08-14 14:25:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2024-08-14 14:25:42,017 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:42,017 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:42,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-08-14 14:25:42,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:42,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:42,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1683849890, now seen corresponding path program 1 times
[2024-08-14 14:25:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:42,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926879350]
[2024-08-14 14:25:42,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:42,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:42,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2024-08-14 14:25:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-08-14 14:25:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2024-08-14 14:25:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926879350]
[2024-08-14 14:25:42,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926879350] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 14:25:42,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 14:25:42,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-08-14 14:25:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059694641]
[2024-08-14 14:25:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 14:25:42,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-08-14 14:25:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-08-14 14:25:42,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-08-14 14:25:42,600 INFO L87 Difference]: Start difference. First operand 209 states and 327 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-08-14 14:25:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:42,705 INFO L93 Difference]: Finished difference Result 209 states and 323 transitions.
[2024-08-14 14:25:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-08-14 14:25:42,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 145
[2024-08-14 14:25:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:42,707 INFO L225 Difference]: With dead ends: 209
[2024-08-14 14:25:42,707 INFO L226 Difference]: Without dead ends: 209
[2024-08-14 14:25:42,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:25:42,708 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 97 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-08-14 14:25:42,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 258 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-08-14 14:25:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states.
[2024-08-14 14:25:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209.
[2024-08-14 14:25:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.5778894472361809) internal successors, (314), 200 states have internal predecessors, (314), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)
[2024-08-14 14:25:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 323 transitions.
[2024-08-14 14:25:42,715 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 323 transitions. Word has length 145
[2024-08-14 14:25:42,715 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:42,716 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 323 transitions.
[2024-08-14 14:25:42,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-08-14 14:25:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 323 transitions.
[2024-08-14 14:25:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2024-08-14 14:25:42,717 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:42,717 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:42,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-08-14 14:25:42,717 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:42,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1174152532, now seen corresponding path program 1 times
[2024-08-14 14:25:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:42,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561694362]
[2024-08-14 14:25:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:42,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:43,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2024-08-14 14:25:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:43,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-08-14 14:25:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2024-08-14 14:25:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:43,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561694362]
[2024-08-14 14:25:43,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561694362] provided 0 perfect and 1 imperfect interpolant sequences
[2024-08-14 14:25:43,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302324402]
[2024-08-14 14:25:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:43,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-08-14 14:25:43,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-08-14 14:25:43,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-08-14 14:25:43,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-08-14 14:25:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:43,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-08-14 14:25:43,501 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2024-08-14 14:25:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-08-14 14:25:43,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-08-14 14:25:43,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302324402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 14:25:43,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-08-14 14:25:43,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13
[2024-08-14 14:25:43,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789641352]
[2024-08-14 14:25:43,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 14:25:43,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-08-14 14:25:43,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:43,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-08-14 14:25:43,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2024-08-14 14:25:43,853 INFO L87 Difference]: Start difference. First operand 209 states and 323 transitions. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-08-14 14:25:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:44,121 INFO L93 Difference]: Finished difference Result 212 states and 325 transitions.
[2024-08-14 14:25:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-08-14 14:25:44,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 147
[2024-08-14 14:25:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:44,123 INFO L225 Difference]: With dead ends: 212
[2024-08-14 14:25:44,123 INFO L226 Difference]: Without dead ends: 212
[2024-08-14 14:25:44,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272
[2024-08-14 14:25:44,124 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 234 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-08-14 14:25:44,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 836 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-08-14 14:25:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2024-08-14 14:25:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212.
[2024-08-14 14:25:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 202 states have (on average 1.5643564356435644) internal successors, (316), 203 states have internal predecessors, (316), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)
[2024-08-14 14:25:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 325 transitions.
[2024-08-14 14:25:44,137 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 325 transitions. Word has length 147
[2024-08-14 14:25:44,137 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:44,137 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 325 transitions.
[2024-08-14 14:25:44,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-08-14 14:25:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 325 transitions.
[2024-08-14 14:25:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2024-08-14 14:25:44,141 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:44,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:44,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-08-14 14:25:44,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-08-14 14:25:44,342 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:44,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash 242801240, now seen corresponding path program 1 times
[2024-08-14 14:25:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:44,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670277]
[2024-08-14 14:25:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:44,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:44,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2024-08-14 14:25:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:44,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-08-14 14:25:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2024-08-14 14:25:44,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670277]
[2024-08-14 14:25:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670277] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 14:25:44,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 14:25:44,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-08-14 14:25:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143497037]
[2024-08-14 14:25:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 14:25:44,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-08-14 14:25:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:44,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-08-14 14:25:44,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-08-14 14:25:44,747 INFO L87 Difference]: Start difference. First operand 212 states and 325 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-08-14 14:25:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:44,842 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions.
[2024-08-14 14:25:44,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-08-14 14:25:44,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 148
[2024-08-14 14:25:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:44,845 INFO L225 Difference]: With dead ends: 332
[2024-08-14 14:25:44,845 INFO L226 Difference]: Without dead ends: 212
[2024-08-14 14:25:44,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-08-14 14:25:44,846 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 130 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-08-14 14:25:44,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 788 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-08-14 14:25:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2024-08-14 14:25:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212.
[2024-08-14 14:25:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 202 states have (on average 1.5594059405940595) internal successors, (315), 203 states have internal predecessors, (315), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)
[2024-08-14 14:25:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 324 transitions.
[2024-08-14 14:25:44,857 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 324 transitions. Word has length 148
[2024-08-14 14:25:44,857 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:44,858 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 324 transitions.
[2024-08-14 14:25:44,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-08-14 14:25:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 324 transitions.
[2024-08-14 14:25:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2024-08-14 14:25:44,859 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:44,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:44,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-08-14 14:25:44,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:44,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:44,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1239746107, now seen corresponding path program 1 times
[2024-08-14 14:25:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:44,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990019786]
[2024-08-14 14:25:44,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:44,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:45,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2024-08-14 14:25:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-08-14 14:25:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 64 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-08-14 14:25:45,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990019786]
[2024-08-14 14:25:45,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990019786] provided 0 perfect and 1 imperfect interpolant sequences
[2024-08-14 14:25:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231873848]
[2024-08-14 14:25:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:45,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-08-14 14:25:45,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-08-14 14:25:45,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-08-14 14:25:45,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-08-14 14:25:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:45,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 16 conjunts are in the unsatisfiable core
[2024-08-14 14:25:45,571 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2024-08-14 14:25:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-08-14 14:25:45,974 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2024-08-14 14:25:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 64 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-08-14 14:25:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231873848] provided 0 perfect and 2 imperfect interpolant sequences
[2024-08-14 14:25:46,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-08-14 14:25:46,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16
[2024-08-14 14:25:46,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836155941]
[2024-08-14 14:25:46,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-08-14 14:25:46,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-08-14 14:25:46,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:46,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-08-14 14:25:46,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240
[2024-08-14 14:25:46,457 INFO L87 Difference]: Start difference. First operand 212 states and 324 transitions. Second operand has 16 states, 16 states have (on average 19.25) internal successors, (308), 16 states have internal predecessors, (308), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2024-08-14 14:25:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:46,792 INFO L93 Difference]: Finished difference Result 212 states and 322 transitions.
[2024-08-14 14:25:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-08-14 14:25:46,792 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 19.25) internal successors, (308), 16 states have internal predecessors, (308), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 149
[2024-08-14 14:25:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:46,793 INFO L225 Difference]: With dead ends: 212
[2024-08-14 14:25:46,793 INFO L226 Difference]: Without dead ends: 212
[2024-08-14 14:25:46,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306
[2024-08-14 14:25:46,795 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 355 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-08-14 14:25:46,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1265 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-08-14 14:25:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2024-08-14 14:25:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212.
[2024-08-14 14:25:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 202 states have (on average 1.5495049504950495) internal successors, (313), 203 states have internal predecessors, (313), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)
[2024-08-14 14:25:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 322 transitions.
[2024-08-14 14:25:46,802 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 322 transitions. Word has length 149
[2024-08-14 14:25:46,802 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:46,802 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 322 transitions.
[2024-08-14 14:25:46,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.25) internal successors, (308), 16 states have internal predecessors, (308), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2024-08-14 14:25:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 322 transitions.
[2024-08-14 14:25:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2024-08-14 14:25:46,804 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:46,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:46,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-08-14 14:25:47,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2024-08-14 14:25:47,005 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:47,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash -730905633, now seen corresponding path program 1 times
[2024-08-14 14:25:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:47,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060752697]
[2024-08-14 14:25:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:47,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2024-08-14 14:25:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:47,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-08-14 14:25:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-08-14 14:25:47,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:47,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060752697]
[2024-08-14 14:25:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060752697] provided 0 perfect and 1 imperfect interpolant sequences
[2024-08-14 14:25:47,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678467235]
[2024-08-14 14:25:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:47,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-08-14 14:25:47,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-08-14 14:25:47,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-08-14 14:25:47,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-08-14 14:25:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:48,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 32 conjunts are in the unsatisfiable core
[2024-08-14 14:25:48,228 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2024-08-14 14:25:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-08-14 14:25:48,652 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2024-08-14 14:25:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 70 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-08-14 14:25:49,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678467235] provided 0 perfect and 2 imperfect interpolant sequences
[2024-08-14 14:25:49,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-08-14 14:25:49,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 28
[2024-08-14 14:25:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506266577]
[2024-08-14 14:25:49,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-08-14 14:25:49,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2024-08-14 14:25:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-08-14 14:25:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756
[2024-08-14 14:25:49,463 INFO L87 Difference]: Start difference. First operand 212 states and 322 transitions. Second operand has 28 states, 28 states have (on average 13.035714285714286) internal successors, (365), 28 states have internal predecessors, (365), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7)
[2024-08-14 14:25:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:50,221 INFO L93 Difference]: Finished difference Result 289 states and 437 transitions.
[2024-08-14 14:25:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2024-08-14 14:25:50,222 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 13.035714285714286) internal successors, (365), 28 states have internal predecessors, (365), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 150
[2024-08-14 14:25:50,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:50,223 INFO L225 Difference]: With dead ends: 289
[2024-08-14 14:25:50,224 INFO L226 Difference]: Without dead ends: 289
[2024-08-14 14:25:50,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722
[2024-08-14 14:25:50,225 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 324 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-08-14 14:25:50,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1953 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-08-14 14:25:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2024-08-14 14:25:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289.
[2024-08-14 14:25:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 278 states have (on average 1.5323741007194245) internal successors, (426), 279 states have internal predecessors, (426), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2024-08-14 14:25:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 437 transitions.
[2024-08-14 14:25:50,231 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 437 transitions. Word has length 150
[2024-08-14 14:25:50,231 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:50,232 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 437 transitions.
[2024-08-14 14:25:50,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.035714285714286) internal successors, (365), 28 states have internal predecessors, (365), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7)
[2024-08-14 14:25:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 437 transitions.
[2024-08-14 14:25:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2024-08-14 14:25:50,233 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:50,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:50,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-08-14 14:25:50,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-08-14 14:25:50,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:50,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1664259970, now seen corresponding path program 1 times
[2024-08-14 14:25:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:50,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667611455]
[2024-08-14 14:25:50,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:50,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2024-08-14 14:25:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:50,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-08-14 14:25:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2024-08-14 14:25:50,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:50,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667611455]
[2024-08-14 14:25:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667611455] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 14:25:50,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 14:25:50,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-08-14 14:25:50,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923843523]
[2024-08-14 14:25:50,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 14:25:50,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-08-14 14:25:50,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:50,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-08-14 14:25:50,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-08-14 14:25:50,925 INFO L87 Difference]: Start difference. First operand 289 states and 437 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-08-14 14:25:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:50,956 INFO L93 Difference]: Finished difference Result 289 states and 436 transitions.
[2024-08-14 14:25:50,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-08-14 14:25:50,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 150
[2024-08-14 14:25:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:50,958 INFO L225 Difference]: With dead ends: 289
[2024-08-14 14:25:50,958 INFO L226 Difference]: Without dead ends: 289
[2024-08-14 14:25:50,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:25:50,959 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 58 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 594 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:25:50,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 594 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-08-14 14:25:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2024-08-14 14:25:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289.
[2024-08-14 14:25:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 278 states have (on average 1.5287769784172662) internal successors, (425), 279 states have internal predecessors, (425), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2024-08-14 14:25:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 436 transitions.
[2024-08-14 14:25:50,964 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 436 transitions. Word has length 150
[2024-08-14 14:25:50,964 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:50,964 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 436 transitions.
[2024-08-14 14:25:50,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-08-14 14:25:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 436 transitions.
[2024-08-14 14:25:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2024-08-14 14:25:50,965 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:50,966 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:50,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-08-14 14:25:50,966 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:50,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:50,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1937628272, now seen corresponding path program 1 times
[2024-08-14 14:25:50,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:50,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167828548]
[2024-08-14 14:25:50,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:50,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:51,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-08-14 14:25:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:51,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-08-14 14:25:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 67 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-08-14 14:25:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:51,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167828548]
[2024-08-14 14:25:51,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167828548] provided 0 perfect and 1 imperfect interpolant sequences
[2024-08-14 14:25:51,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964742442]
[2024-08-14 14:25:51,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:51,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-08-14 14:25:51,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-08-14 14:25:51,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-08-14 14:25:51,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-08-14 14:25:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:51,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 56 conjunts are in the unsatisfiable core
[2024-08-14 14:25:51,648 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2024-08-14 14:25:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-08-14 14:25:51,888 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2024-08-14 14:25:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 41 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-08-14 14:25:52,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964742442] provided 0 perfect and 2 imperfect interpolant sequences
[2024-08-14 14:25:52,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-08-14 14:25:52,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 15] total 26
[2024-08-14 14:25:52,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975238272]
[2024-08-14 14:25:52,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-08-14 14:25:52,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-08-14 14:25:52,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:52,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-08-14 14:25:52,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650
[2024-08-14 14:25:52,422 INFO L87 Difference]: Start difference. First operand 289 states and 436 transitions. Second operand has 26 states, 26 states have (on average 13.346153846153847) internal successors, (347), 26 states have internal predecessors, (347), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2024-08-14 14:25:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:53,090 INFO L93 Difference]: Finished difference Result 298 states and 442 transitions.
[2024-08-14 14:25:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-08-14 14:25:53,091 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 13.346153846153847) internal successors, (347), 26 states have internal predecessors, (347), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 151
[2024-08-14 14:25:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:53,092 INFO L225 Difference]: With dead ends: 298
[2024-08-14 14:25:53,092 INFO L226 Difference]: Without dead ends: 298
[2024-08-14 14:25:53,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992
[2024-08-14 14:25:53,093 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 268 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-08-14 14:25:53,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1964 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-08-14 14:25:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states.
[2024-08-14 14:25:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298.
[2024-08-14 14:25:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 287 states have (on average 1.5017421602787457) internal successors, (431), 288 states have internal predecessors, (431), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2024-08-14 14:25:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 442 transitions.
[2024-08-14 14:25:53,099 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 442 transitions. Word has length 151
[2024-08-14 14:25:53,099 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:53,099 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 442 transitions.
[2024-08-14 14:25:53,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.346153846153847) internal successors, (347), 26 states have internal predecessors, (347), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2024-08-14 14:25:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions.
[2024-08-14 14:25:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-08-14 14:25:53,100 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:53,101 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:53,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-08-14 14:25:53,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-08-14 14:25:53,302 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:53,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash -802145583, now seen corresponding path program 1 times
[2024-08-14 14:25:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472336359]
[2024-08-14 14:25:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-08-14 14:25:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-08-14 14:25:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-08-14 14:25:53,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:53,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472336359]
[2024-08-14 14:25:53,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472336359] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 14:25:53,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 14:25:53,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-08-14 14:25:53,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321686198]
[2024-08-14 14:25:53,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 14:25:53,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-08-14 14:25:53,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-08-14 14:25:53,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-08-14 14:25:53,977 INFO L87 Difference]: Start difference. First operand 298 states and 442 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-08-14 14:25:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:54,008 INFO L93 Difference]: Finished difference Result 298 states and 441 transitions.
[2024-08-14 14:25:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-08-14 14:25:54,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 153
[2024-08-14 14:25:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:54,010 INFO L225 Difference]: With dead ends: 298
[2024-08-14 14:25:54,010 INFO L226 Difference]: Without dead ends: 298
[2024-08-14 14:25:54,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-08-14 14:25:54,010 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 169 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-08-14 14:25:54,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 488 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-08-14 14:25:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states.
[2024-08-14 14:25:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298.
[2024-08-14 14:25:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 287 states have (on average 1.4982578397212543) internal successors, (430), 288 states have internal predecessors, (430), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2024-08-14 14:25:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 441 transitions.
[2024-08-14 14:25:54,017 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 441 transitions. Word has length 153
[2024-08-14 14:25:54,017 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:54,017 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 441 transitions.
[2024-08-14 14:25:54,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-08-14 14:25:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 441 transitions.
[2024-08-14 14:25:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-08-14 14:25:54,018 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:54,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:54,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-08-14 14:25:54,019 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:54,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash 484336722, now seen corresponding path program 2 times
[2024-08-14 14:25:54,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275425502]
[2024-08-14 14:25:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-08-14 14:25:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:54,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-08-14 14:25:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:54,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-08-14 14:25:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 14:25:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2024-08-14 14:25:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 14:25:54,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275425502]
[2024-08-14 14:25:54,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275425502] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 14:25:54,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 14:25:54,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-08-14 14:25:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891820833]
[2024-08-14 14:25:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 14:25:54,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-08-14 14:25:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 14:25:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-08-14 14:25:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-08-14 14:25:54,767 INFO L87 Difference]: Start difference. First operand 298 states and 441 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-08-14 14:25:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-08-14 14:25:54,807 INFO L93 Difference]: Finished difference Result 442 states and 655 transitions.
[2024-08-14 14:25:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-08-14 14:25:54,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153
[2024-08-14 14:25:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-08-14 14:25:54,809 INFO L225 Difference]: With dead ends: 442
[2024-08-14 14:25:54,809 INFO L226 Difference]: Without dead ends: 442
[2024-08-14 14:25:54,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-08-14 14:25:54,810 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 39 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-08-14 14:25:54,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1071 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-08-14 14:25:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states.
[2024-08-14 14:25:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 436.
[2024-08-14 14:25:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 425 states have (on average 1.4941176470588236) internal successors, (635), 426 states have internal predecessors, (635), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2024-08-14 14:25:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 646 transitions.
[2024-08-14 14:25:54,817 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 646 transitions. Word has length 153
[2024-08-14 14:25:54,817 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-08-14 14:25:54,817 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 646 transitions.
[2024-08-14 14:25:54,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-08-14 14:25:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 646 transitions.
[2024-08-14 14:25:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-08-14 14:25:54,819 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:25:54,819 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:54,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-08-14 14:25:54,819 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:25:54,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:25:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash 613419441, now seen corresponding path program 1 times
[2024-08-14 14:25:54,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 14:25:54,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233647765]
[2024-08-14 14:25:54,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:54,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 14:25:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-08-14 14:25:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557280074]
[2024-08-14 14:25:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:25:54,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-08-14 14:25:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-08-14 14:25:54,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-08-14 14:25:54,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-08-14 14:25:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-08-14 14:25:55,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-08-14 14:25:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-08-14 14:25:55,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-08-14 14:25:55,476 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2024-08-14 14:25:55,476 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-08-14 14:25:55,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-08-14 14:25:55,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-08-14 14:25:55,684 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-08-14 14:25:55,687 INFO L196 ceAbstractionStarter]: Computing trace abstraction results
[2024-08-14 14:25:55,768 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:25:55 BoogieIcfgContainer
[2024-08-14 14:25:55,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-08-14 14:25:55,770 INFO L158 Benchmark]: Toolchain (without parser) took 16869.66ms. Allocated memory was 169.9MB in the beginning and 536.9MB in the end (delta: 367.0MB). Free memory was 96.9MB in the beginning and 270.3MB in the end (delta: -173.4MB). Peak memory consumption was 196.6MB. Max. memory is 16.1GB.
[2024-08-14 14:25:55,770 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-08-14 14:25:55,770 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-08-14 14:25:55,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.48ms. Allocated memory is still 169.9MB. Free memory was 96.9MB in the beginning and 79.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-08-14 14:25:55,770 INFO L158 Benchmark]: Boogie Preprocessor took 76.90ms. Allocated memory is still 169.9MB. Free memory was 79.3MB in the beginning and 75.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-08-14 14:25:55,771 INFO L158 Benchmark]: IcfgBuilder took 711.16ms. Allocated memory is still 169.9MB. Free memory was 75.4MB in the beginning and 93.7MB in the end (delta: -18.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB.
[2024-08-14 14:25:55,771 INFO L158 Benchmark]: TraceAbstraction took 15775.00ms. Allocated memory was 169.9MB in the beginning and 536.9MB in the end (delta: 367.0MB). Free memory was 93.3MB in the beginning and 270.3MB in the end (delta: -177.0MB). Peak memory consumption was 193.2MB. Max. memory is 16.1GB.
[2024-08-14 14:25:55,772 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.15ms. Allocated memory is still 117.4MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB.
* Witness Parser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 302.48ms. Allocated memory is still 169.9MB. Free memory was 96.9MB in the beginning and 79.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 76.90ms. Allocated memory is still 169.9MB. Free memory was 79.3MB in the beginning and 75.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* IcfgBuilder took 711.16ms. Allocated memory is still 169.9MB. Free memory was 75.4MB in the beginning and 93.7MB in the end (delta: -18.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 15775.00ms. Allocated memory was 169.9MB in the beginning and 536.9MB in the end (delta: 367.0MB). Free memory was 93.3MB in the beginning and 270.3MB in the end (delta: -177.0MB). Peak memory consumption was 193.2MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- 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 bitwiseOr at line 107, overapproximation of bitwiseAnd at line 169.
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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32);
[L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1);
[L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10);
[L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1);
[L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64);
[L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1);
[L38] const SORT_1 var_10 = 0;
[L39] const SORT_14 var_15 = 0;
[L40] const SORT_1 var_24 = 1;
[L41] const SORT_5 var_28 = 0;
[L42] const SORT_8 var_35 = 0;
[L43] const SORT_5 var_57 = 1;
[L44] const SORT_5 var_61 = 1000;
[L45] const SORT_5 var_63 = 3735928559;
[L46] const SORT_5 var_66 = 12245771;
[L48] SORT_1 input_2;
[L49] SORT_1 input_3;
[L50] SORT_1 input_4;
[L51] SORT_5 input_6;
[L52] SORT_5 input_7;
[L53] SORT_8 input_9;
[L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1
[L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L55] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1;
[L56] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14
[L56] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L56] SORT_14 state_16 = __VERIFIER_nondet_ulong() & mask_SORT_14;
[L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14
[L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L57] SORT_14 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_14;
[L58] EXPR __VERIFIER_nondet_uint() & mask_SORT_5
[L58] EXPR __VERIFIER_nondet_uint() & mask_SORT_5
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L58] SORT_5 state_29 = __VERIFIER_nondet_uint() & mask_SORT_5;
[L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_5
[L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_5
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L59] SORT_5 state_31 = __VERIFIER_nondet_uint() & mask_SORT_5;
[L60] EXPR __VERIFIER_nondet_ushort() & mask_SORT_8
[L60] EXPR __VERIFIER_nondet_ushort() & mask_SORT_8
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L60] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8;
[L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1
[L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L61] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1;
[L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1
[L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L62] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1;
[L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_5
[L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_5
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L63] SORT_5 state_42 = __VERIFIER_nondet_uint() & mask_SORT_5;
[L64] EXPR __VERIFIER_nondet_uint() & mask_SORT_5
[L64] EXPR __VERIFIER_nondet_uint() & mask_SORT_5
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L64] SORT_5 state_44 = __VERIFIER_nondet_uint() & mask_SORT_5;
[L66] SORT_1 init_12_arg_1 = var_10;
[L67] state_11 = init_12_arg_1
[L68] SORT_14 init_17_arg_1 = var_15;
[L69] state_16 = init_17_arg_1
[L70] SORT_14 init_19_arg_1 = var_15;
[L71] state_18 = init_19_arg_1
[L72] SORT_5 init_30_arg_1 = var_28;
[L73] state_29 = init_30_arg_1
[L74] SORT_5 init_32_arg_1 = var_28;
[L75] state_31 = init_32_arg_1
[L76] SORT_8 init_37_arg_1 = var_35;
[L77] state_36 = init_37_arg_1
[L78] SORT_1 init_39_arg_1 = var_24;
[L79] state_38 = init_39_arg_1
[L80] SORT_1 init_41_arg_1 = var_24;
[L81] state_40 = init_41_arg_1
[L82] SORT_5 init_43_arg_1 = var_28;
[L83] state_42 = init_43_arg_1
[L84] SORT_5 init_45_arg_1 = var_28;
[L85] state_44 = init_45_arg_1
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L88] input_2 = __VERIFIER_nondet_uchar()
[L89] input_3 = __VERIFIER_nondet_uchar()
[L90] EXPR input_3 & mask_SORT_1
[L90] EXPR input_3 & mask_SORT_1
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L90] input_3 = input_3 & mask_SORT_1
[L91] input_4 = __VERIFIER_nondet_uchar()
[L92] EXPR input_4 & mask_SORT_1
[L92] EXPR input_4 & mask_SORT_1
VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L92] input_4 = input_4 & mask_SORT_1
[L93] input_6 = __VERIFIER_nondet_uint()
[L94] EXPR input_6 & mask_SORT_5
[L94] EXPR input_6 & mask_SORT_5
VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L94] input_6 = input_6 & mask_SORT_5
[L95] input_7 = __VERIFIER_nondet_uint()
[L96] EXPR input_7 & mask_SORT_5
[L96] EXPR input_7 & mask_SORT_5
VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L96] input_7 = input_7 & mask_SORT_5
[L97] input_9 = __VERIFIER_nondet_ushort()
[L100] SORT_1 var_13_arg_0 = state_11;
[L101] SORT_1 var_13 = ~var_13_arg_0;
[L102] SORT_14 var_20_arg_0 = state_16;
[L103] SORT_14 var_20_arg_1 = state_18;
[L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1;
[L105] SORT_1 var_21_arg_0 = var_13;
[L106] SORT_1 var_21_arg_1 = var_20;
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L107] EXPR var_21_arg_0 | var_21_arg_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L107] EXPR var_21_arg_0 | var_21_arg_1
[L107] EXPR var_21_arg_0 | var_21_arg_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1;
[L108] SORT_1 var_25_arg_0 = var_21;
[L109] SORT_1 var_25 = ~var_25_arg_0;
[L110] SORT_1 var_26_arg_0 = var_24;
[L111] SORT_1 var_26_arg_1 = var_25;
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-256, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L112] EXPR var_26_arg_0 & var_26_arg_1
[L112] EXPR var_26_arg_0 & var_26_arg_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1;
[L113] EXPR var_26 & mask_SORT_1
[L113] EXPR var_26 & mask_SORT_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L113] var_26 = var_26 & mask_SORT_1
[L114] SORT_1 bad_27_arg_0 = var_26;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L115] CALL __VERIFIER_assert(!(bad_27_arg_0))
VAL [\old(cond)=1]
[L21] COND FALSE !(!(cond))
VAL [\old(cond)=1]
[L115] RET __VERIFIER_assert(!(bad_27_arg_0))
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L117] SORT_1 next_51_arg_1 = var_24;
[L118] SORT_1 var_33_arg_0 = state_11;
[L119] SORT_1 var_33 = ~var_33_arg_0;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=-1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L120] EXPR var_33 & mask_SORT_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=-1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L120] EXPR var_33 & mask_SORT_1
[L120] EXPR var_33 & mask_SORT_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L120] var_33 = var_33 & mask_SORT_1
[L121] SORT_5 var_52_arg_0 = state_29;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_52_arg_0=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L122] EXPR var_52_arg_0 & mask_SORT_5
[L122] EXPR var_52_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5
[L123] SORT_14 var_52 = var_52_arg_0;
[L124] SORT_5 var_53_arg_0 = state_31;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_52=0, var_53_arg_0=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L125] EXPR var_53_arg_0 & mask_SORT_5
[L125] EXPR var_53_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_52=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5
[L126] SORT_14 var_53 = var_53_arg_0;
[L127] SORT_14 var_54_arg_0 = var_52;
[L128] SORT_14 var_54_arg_1 = var_53;
[L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1;
[L130] SORT_1 var_55_arg_0 = var_33;
[L131] SORT_14 var_55_arg_1 = var_15;
[L132] SORT_14 var_55_arg_2 = var_54;
[L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_55=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L134] EXPR var_55 & mask_SORT_14
[L134] EXPR var_55 & mask_SORT_14
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L134] var_55 = var_55 & mask_SORT_14
[L135] SORT_14 next_56_arg_1 = var_55;
[L136] SORT_1 var_70_arg_0 = state_38;
[L137] SORT_1 var_70_arg_1 = state_40;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70_arg_0=1, var_70_arg_1=1]
[L138] EXPR var_70_arg_0 | var_70_arg_1
[L138] EXPR var_70_arg_0 | var_70_arg_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1;
[L139] EXPR var_70 & mask_SORT_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70=1]
[L139] EXPR var_70 & mask_SORT_1
[L139] EXPR var_70 & mask_SORT_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L139] var_70 = var_70 & mask_SORT_1
[L140] SORT_8 var_60_arg_0 = state_36;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_60_arg_0=0, var_61=1000, var_63=3735928559, var_66=12245771, var_70=1]
[L141] EXPR var_60_arg_0 & mask_SORT_8
[L141] EXPR var_60_arg_0 & mask_SORT_8
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70=1]
[L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8
[L142] SORT_5 var_60 = var_60_arg_0;
[L143] SORT_5 var_62_arg_0 = var_60;
[L144] SORT_5 var_62_arg_1 = var_61;
[L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1;
[L146] SORT_5 var_64_arg_0 = input_6;
[L147] SORT_5 var_64_arg_1 = var_63;
[L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1;
[L149] SORT_1 var_65_arg_0 = var_62;
[L150] SORT_1 var_65_arg_1 = var_64;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_65_arg_0=0, var_65_arg_1=0, var_66=12245771, var_70=1]
[L151] EXPR var_65_arg_0 & var_65_arg_1
[L151] EXPR var_65_arg_0 & var_65_arg_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70=1]
[L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1;
[L152] SORT_5 var_67_arg_0 = input_7;
[L153] SORT_5 var_67_arg_1 = var_66;
[L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1;
[L155] SORT_1 var_68_arg_0 = var_65;
[L156] SORT_1 var_68_arg_1 = var_67;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68_arg_0=0, var_68_arg_1=0, var_70=1]
[L157] EXPR var_68_arg_0 & var_68_arg_1
[L157] EXPR var_68_arg_0 & var_68_arg_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70=1]
[L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1;
[L158] EXPR var_68 & mask_SORT_1
[L158] EXPR var_68 & mask_SORT_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70=1]
[L158] var_68 = var_68 & mask_SORT_1
[L159] SORT_5 var_46_arg_0 = state_42;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_46_arg_0=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=1]
[L160] EXPR var_46_arg_0 & mask_SORT_5
[L160] EXPR var_46_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=1]
[L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5
[L161] SORT_14 var_46 = var_46_arg_0;
[L162] SORT_5 var_47_arg_0 = state_44;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_46=0, var_47_arg_0=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=1]
[L163] EXPR var_47_arg_0 & mask_SORT_5
[L163] EXPR var_47_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_46=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=1]
[L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5
[L164] SORT_14 var_47 = var_47_arg_0;
[L165] SORT_14 var_48_arg_0 = var_46;
[L166] SORT_14 var_48_arg_1 = var_47;
[L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1;
[L168] SORT_5 var_58_arg_0 = var_57;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_48=0, var_57=1, var_58_arg_0=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=1]
[L169] EXPR var_58_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_48=0, var_57=1, var_58_arg_0=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=1]
[L169] EXPR var_58_arg_0 & mask_SORT_5
[L169] EXPR var_58_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_48=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=1]
[L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5
[L170] SORT_14 var_58 = var_58_arg_0;
[L171] SORT_14 var_59_arg_0 = var_48;
[L172] SORT_14 var_59_arg_1 = var_58;
[L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1;
[L174] SORT_1 var_69_arg_0 = var_68;
[L175] SORT_14 var_69_arg_1 = var_59;
[L176] SORT_14 var_69_arg_2 = var_48;
[L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2;
[L178] SORT_1 var_71_arg_0 = var_70;
[L179] SORT_14 var_71_arg_1 = var_69;
[L180] SORT_14 var_71_arg_2 = state_18;
[L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2;
[L182] SORT_1 var_72_arg_0 = var_33;
[L183] SORT_14 var_72_arg_1 = var_15;
[L184] SORT_14 var_72_arg_2 = var_71;
[L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_72=0]
[L186] EXPR var_72 & mask_SORT_14
[L186] EXPR var_72 & mask_SORT_14
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L186] var_72 = var_72 & mask_SORT_14
[L187] SORT_14 next_73_arg_1 = var_72;
[L188] SORT_1 var_74_arg_0 = input_3;
[L189] SORT_5 var_74_arg_1 = input_6;
[L190] SORT_5 var_74_arg_2 = state_29;
[L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2;
[L192] SORT_1 var_75_arg_0 = var_33;
[L193] SORT_5 var_75_arg_1 = var_28;
[L194] SORT_5 var_75_arg_2 = var_74;
[L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2;
[L196] SORT_5 next_76_arg_1 = var_75;
[L197] SORT_1 var_77_arg_0 = input_4;
[L198] SORT_5 var_77_arg_1 = input_7;
[L199] SORT_5 var_77_arg_2 = state_31;
[L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2;
[L201] SORT_1 var_78_arg_0 = var_33;
[L202] SORT_5 var_78_arg_1 = var_28;
[L203] SORT_5 var_78_arg_2 = var_77;
[L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2;
[L205] SORT_5 next_79_arg_1 = var_78;
[L206] SORT_1 var_80_arg_0 = var_33;
[L207] SORT_8 var_80_arg_1 = input_9;
[L208] SORT_8 var_80_arg_2 = state_36;
[L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2;
[L210] SORT_8 next_81_arg_1 = var_80;
[L211] SORT_1 var_82_arg_0 = var_33;
[L212] SORT_1 var_82_arg_1 = var_24;
[L213] SORT_1 var_82_arg_2 = input_3;
[L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2;
[L215] SORT_1 next_83_arg_1 = var_82;
[L216] SORT_1 var_84_arg_0 = var_33;
[L217] SORT_1 var_84_arg_1 = var_24;
[L218] SORT_1 var_84_arg_2 = input_4;
[L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2;
[L220] SORT_1 next_85_arg_1 = var_84;
[L221] SORT_1 var_86_arg_0 = input_3;
[L222] SORT_5 var_86_arg_1 = input_6;
[L223] SORT_5 var_86_arg_2 = state_42;
[L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2;
[L225] SORT_1 var_87_arg_0 = var_33;
[L226] SORT_5 var_87_arg_1 = var_28;
[L227] SORT_5 var_87_arg_2 = var_86;
[L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2;
[L229] SORT_5 next_88_arg_1 = var_87;
[L230] SORT_1 var_89_arg_0 = input_4;
[L231] SORT_5 var_89_arg_1 = input_7;
[L232] SORT_5 var_89_arg_2 = state_44;
[L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2;
[L234] SORT_1 var_90_arg_0 = var_33;
[L235] SORT_5 var_90_arg_1 = var_28;
[L236] SORT_5 var_90_arg_2 = var_89;
[L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2;
[L238] SORT_5 next_91_arg_1 = var_90;
[L240] state_11 = next_51_arg_1
[L241] state_16 = next_56_arg_1
[L242] state_18 = next_73_arg_1
[L243] state_29 = next_76_arg_1
[L244] state_31 = next_79_arg_1
[L245] state_36 = next_81_arg_1
[L246] state_38 = next_83_arg_1
[L247] state_40 = next_85_arg_1
[L248] state_42 = next_88_arg_1
[L249] state_44 = next_91_arg_1
[L88] input_2 = __VERIFIER_nondet_uchar()
[L89] input_3 = __VERIFIER_nondet_uchar()
[L90] EXPR input_3 & mask_SORT_1
[L90] EXPR input_3 & mask_SORT_1
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L90] input_3 = input_3 & mask_SORT_1
[L91] input_4 = __VERIFIER_nondet_uchar()
[L92] EXPR input_4 & mask_SORT_1
[L92] EXPR input_4 & mask_SORT_1
VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L92] input_4 = input_4 & mask_SORT_1
[L93] input_6 = __VERIFIER_nondet_uint()
[L94] EXPR input_6 & mask_SORT_5
[L94] EXPR input_6 & mask_SORT_5
VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L94] input_6 = input_6 & mask_SORT_5
[L95] input_7 = __VERIFIER_nondet_uint()
[L96] EXPR input_7 & mask_SORT_5
[L96] EXPR input_7 & mask_SORT_5
VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L96] input_7 = input_7 & mask_SORT_5
[L97] input_9 = __VERIFIER_nondet_ushort()
[L100] SORT_1 var_13_arg_0 = state_11;
[L101] SORT_1 var_13 = ~var_13_arg_0;
[L102] SORT_14 var_20_arg_0 = state_16;
[L103] SORT_14 var_20_arg_1 = state_18;
[L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1;
[L105] SORT_1 var_21_arg_0 = var_13;
[L106] SORT_1 var_21_arg_1 = var_20;
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_21_arg_0=-2, var_21_arg_1=1, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L107] EXPR var_21_arg_0 | var_21_arg_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_21_arg_0=-2, var_21_arg_1=1, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L107] EXPR var_21_arg_0 | var_21_arg_1
[L107] EXPR var_21_arg_0 | var_21_arg_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1;
[L108] SORT_1 var_25_arg_0 = var_21;
[L109] SORT_1 var_25 = ~var_25_arg_0;
[L110] SORT_1 var_26_arg_0 = var_24;
[L111] SORT_1 var_26_arg_1 = var_25;
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-256, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L112] EXPR var_26_arg_0 & var_26_arg_1
[L112] EXPR var_26_arg_0 & var_26_arg_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1;
[L113] EXPR var_26 & mask_SORT_1
[L113] EXPR var_26 & mask_SORT_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L113] var_26 = var_26 & mask_SORT_1
[L114] SORT_1 bad_27_arg_0 = var_26;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L115] CALL __VERIFIER_assert(!(bad_27_arg_0))
VAL [\old(cond)=1]
[L21] COND FALSE !(!(cond))
VAL [\old(cond)=1]
[L115] RET __VERIFIER_assert(!(bad_27_arg_0))
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L117] SORT_1 next_51_arg_1 = var_24;
[L118] SORT_1 var_33_arg_0 = state_11;
[L119] SORT_1 var_33 = ~var_33_arg_0;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=-2, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L120] EXPR var_33 & mask_SORT_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=-2, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L120] EXPR var_33 & mask_SORT_1
[L120] EXPR var_33 & mask_SORT_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L120] var_33 = var_33 & mask_SORT_1
[L121] SORT_5 var_52_arg_0 = state_29;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_52_arg_0=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L122] EXPR var_52_arg_0 & mask_SORT_5
[L122] EXPR var_52_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5
[L123] SORT_14 var_52 = var_52_arg_0;
[L124] SORT_5 var_53_arg_0 = state_31;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_52=0, var_53_arg_0=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L125] EXPR var_53_arg_0 & mask_SORT_5
[L125] EXPR var_53_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_52=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5
[L126] SORT_14 var_53 = var_53_arg_0;
[L127] SORT_14 var_54_arg_0 = var_52;
[L128] SORT_14 var_54_arg_1 = var_53;
[L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1;
[L130] SORT_1 var_55_arg_0 = var_33;
[L131] SORT_14 var_55_arg_1 = var_15;
[L132] SORT_14 var_55_arg_2 = var_54;
[L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_55=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L134] EXPR var_55 & mask_SORT_14
[L134] EXPR var_55 & mask_SORT_14
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L134] var_55 = var_55 & mask_SORT_14
[L135] SORT_14 next_56_arg_1 = var_55;
[L136] SORT_1 var_70_arg_0 = state_38;
[L137] SORT_1 var_70_arg_1 = state_40;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70_arg_0=0, var_70_arg_1=0]
[L138] EXPR var_70_arg_0 | var_70_arg_1
[L138] EXPR var_70_arg_0 | var_70_arg_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1;
[L139] EXPR var_70 & mask_SORT_1
[L139] EXPR var_70 & mask_SORT_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L139] var_70 = var_70 & mask_SORT_1
[L140] SORT_8 var_60_arg_0 = state_36;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_60_arg_0=0, var_61=1000, var_63=3735928559, var_66=12245771, var_70=0]
[L141] EXPR var_60_arg_0 & mask_SORT_8
[L141] EXPR var_60_arg_0 & mask_SORT_8
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70=0]
[L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8
[L142] SORT_5 var_60 = var_60_arg_0;
[L143] SORT_5 var_62_arg_0 = var_60;
[L144] SORT_5 var_62_arg_1 = var_61;
[L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1;
[L146] SORT_5 var_64_arg_0 = input_6;
[L147] SORT_5 var_64_arg_1 = var_63;
[L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1;
[L149] SORT_1 var_65_arg_0 = var_62;
[L150] SORT_1 var_65_arg_1 = var_64;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_65_arg_0=0, var_65_arg_1=0, var_66=12245771, var_70=0]
[L151] EXPR var_65_arg_0 & var_65_arg_1
[L151] EXPR var_65_arg_0 & var_65_arg_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70=0]
[L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1;
[L152] SORT_5 var_67_arg_0 = input_7;
[L153] SORT_5 var_67_arg_1 = var_66;
[L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1;
[L155] SORT_1 var_68_arg_0 = var_65;
[L156] SORT_1 var_68_arg_1 = var_67;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68_arg_0=0, var_68_arg_1=0, var_70=0]
[L157] EXPR var_68_arg_0 & var_68_arg_1
[L157] EXPR var_68_arg_0 & var_68_arg_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70=0]
[L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1;
[L158] EXPR var_68 & mask_SORT_1
[L158] EXPR var_68 & mask_SORT_1
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_70=0]
[L158] var_68 = var_68 & mask_SORT_1
[L159] SORT_5 var_46_arg_0 = state_42;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_46_arg_0=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=0]
[L160] EXPR var_46_arg_0 & mask_SORT_5
[L160] EXPR var_46_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=0]
[L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5
[L161] SORT_14 var_46 = var_46_arg_0;
[L162] SORT_5 var_47_arg_0 = state_44;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_46=0, var_47_arg_0=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=0]
[L163] EXPR var_47_arg_0 & mask_SORT_5
[L163] EXPR var_47_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_46=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=0]
[L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5
[L164] SORT_14 var_47 = var_47_arg_0;
[L165] SORT_14 var_48_arg_0 = var_46;
[L166] SORT_14 var_48_arg_1 = var_47;
[L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1;
[L168] SORT_5 var_58_arg_0 = var_57;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_48=0, var_57=1, var_58_arg_0=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=0]
[L169] EXPR var_58_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_48=0, var_57=1, var_58_arg_0=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=0]
[L169] EXPR var_58_arg_0 & mask_SORT_5
[L169] EXPR var_58_arg_0 & mask_SORT_5
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_48=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_68=0, var_70=0]
[L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5
[L170] SORT_14 var_58 = var_58_arg_0;
[L171] SORT_14 var_59_arg_0 = var_48;
[L172] SORT_14 var_59_arg_1 = var_58;
[L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1;
[L174] SORT_1 var_69_arg_0 = var_68;
[L175] SORT_14 var_69_arg_1 = var_59;
[L176] SORT_14 var_69_arg_2 = var_48;
[L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2;
[L178] SORT_1 var_71_arg_0 = var_70;
[L179] SORT_14 var_71_arg_1 = var_69;
[L180] SORT_14 var_71_arg_2 = state_18;
[L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2;
[L182] SORT_1 var_72_arg_0 = var_33;
[L183] SORT_14 var_72_arg_1 = var_15;
[L184] SORT_14 var_72_arg_2 = var_71;
[L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771, var_72=0]
[L186] EXPR var_72 & mask_SORT_14
[L186] EXPR var_72 & mask_SORT_14
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L186] var_72 = var_72 & mask_SORT_14
[L187] SORT_14 next_73_arg_1 = var_72;
[L188] SORT_1 var_74_arg_0 = input_3;
[L189] SORT_5 var_74_arg_1 = input_6;
[L190] SORT_5 var_74_arg_2 = state_29;
[L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2;
[L192] SORT_1 var_75_arg_0 = var_33;
[L193] SORT_5 var_75_arg_1 = var_28;
[L194] SORT_5 var_75_arg_2 = var_74;
[L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2;
[L196] SORT_5 next_76_arg_1 = var_75;
[L197] SORT_1 var_77_arg_0 = input_4;
[L198] SORT_5 var_77_arg_1 = input_7;
[L199] SORT_5 var_77_arg_2 = state_31;
[L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2;
[L201] SORT_1 var_78_arg_0 = var_33;
[L202] SORT_5 var_78_arg_1 = var_28;
[L203] SORT_5 var_78_arg_2 = var_77;
[L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2;
[L205] SORT_5 next_79_arg_1 = var_78;
[L206] SORT_1 var_80_arg_0 = var_33;
[L207] SORT_8 var_80_arg_1 = input_9;
[L208] SORT_8 var_80_arg_2 = state_36;
[L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2;
[L210] SORT_8 next_81_arg_1 = var_80;
[L211] SORT_1 var_82_arg_0 = var_33;
[L212] SORT_1 var_82_arg_1 = var_24;
[L213] SORT_1 var_82_arg_2 = input_3;
[L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2;
[L215] SORT_1 next_83_arg_1 = var_82;
[L216] SORT_1 var_84_arg_0 = var_33;
[L217] SORT_1 var_84_arg_1 = var_24;
[L218] SORT_1 var_84_arg_2 = input_4;
[L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2;
[L220] SORT_1 next_85_arg_1 = var_84;
[L221] SORT_1 var_86_arg_0 = input_3;
[L222] SORT_5 var_86_arg_1 = input_6;
[L223] SORT_5 var_86_arg_2 = state_42;
[L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2;
[L225] SORT_1 var_87_arg_0 = var_33;
[L226] SORT_5 var_87_arg_1 = var_28;
[L227] SORT_5 var_87_arg_2 = var_86;
[L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2;
[L229] SORT_5 next_88_arg_1 = var_87;
[L230] SORT_1 var_89_arg_0 = input_4;
[L231] SORT_5 var_89_arg_1 = input_7;
[L232] SORT_5 var_89_arg_2 = state_44;
[L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2;
[L234] SORT_1 var_90_arg_0 = var_33;
[L235] SORT_5 var_90_arg_1 = var_28;
[L236] SORT_5 var_90_arg_2 = var_89;
[L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2;
[L238] SORT_5 next_91_arg_1 = var_90;
[L240] state_11 = next_51_arg_1
[L241] state_16 = next_56_arg_1
[L242] state_18 = next_73_arg_1
[L243] state_29 = next_76_arg_1
[L244] state_31 = next_79_arg_1
[L245] state_36 = next_81_arg_1
[L246] state_38 = next_83_arg_1
[L247] state_40 = next_85_arg_1
[L248] state_42 = next_88_arg_1
[L249] state_44 = next_91_arg_1
[L88] input_2 = __VERIFIER_nondet_uchar()
[L89] input_3 = __VERIFIER_nondet_uchar()
[L90] EXPR input_3 & mask_SORT_1
[L90] EXPR input_3 & mask_SORT_1
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L90] input_3 = input_3 & mask_SORT_1
[L91] input_4 = __VERIFIER_nondet_uchar()
[L92] EXPR input_4 & mask_SORT_1
[L92] EXPR input_4 & mask_SORT_1
VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L92] input_4 = input_4 & mask_SORT_1
[L93] input_6 = __VERIFIER_nondet_uint()
[L94] EXPR input_6 & mask_SORT_5
[L94] EXPR input_6 & mask_SORT_5
VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L94] input_6 = input_6 & mask_SORT_5
[L95] input_7 = __VERIFIER_nondet_uint()
[L96] EXPR input_7 & mask_SORT_5
[L96] EXPR input_7 & mask_SORT_5
VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L96] input_7 = input_7 & mask_SORT_5
[L97] input_9 = __VERIFIER_nondet_ushort()
[L100] SORT_1 var_13_arg_0 = state_11;
[L101] SORT_1 var_13 = ~var_13_arg_0;
[L102] SORT_14 var_20_arg_0 = state_16;
[L103] SORT_14 var_20_arg_1 = state_18;
[L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1;
[L105] SORT_1 var_21_arg_0 = var_13;
[L106] SORT_1 var_21_arg_1 = var_20;
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-2, var_21_arg_1=1, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L107] EXPR var_21_arg_0 | var_21_arg_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-2, var_21_arg_1=1, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L107] EXPR var_21_arg_0 | var_21_arg_1
[L107] EXPR var_21_arg_0 | var_21_arg_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1;
[L108] SORT_1 var_25_arg_0 = var_21;
[L109] SORT_1 var_25 = ~var_25_arg_0;
[L110] SORT_1 var_26_arg_0 = var_24;
[L111] SORT_1 var_26_arg_1 = var_25;
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-255, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L112] EXPR var_26_arg_0 & var_26_arg_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-255, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L112] EXPR var_26_arg_0 & var_26_arg_1
[L112] EXPR var_26_arg_0 & var_26_arg_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1;
[L113] EXPR var_26 & mask_SORT_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L113] EXPR var_26 & mask_SORT_1
[L113] EXPR var_26 & mask_SORT_1
VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L113] var_26 = var_26 & mask_SORT_1
[L114] SORT_1 bad_27_arg_0 = var_26;
VAL [bad_27_arg_0=1, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771]
[L115] CALL __VERIFIER_assert(!(bad_27_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, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1752 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1747 mSDsluCounter, 10540 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8855 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2897 IncrementalHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1685 mSDtfsCounter, 2897 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1217 GetRequests, 1088 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=0, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 223 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 2536 NumberOfCodeBlocks, 2536 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2662 ConstructedInterpolants, 0 QuantifiedInterpolants, 12670 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3158 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 1394/1560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-08-14 14:25:55,824 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.mul5.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.mul5.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements
--- Real Ultimate output ---
This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m
[2024-08-14 14:25:57,822 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-08-14 14:25:57,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf
[2024-08-14 14:25:57,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-08-14 14:25:57,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-08-14 14:25:57,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-08-14 14:25:57,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-08-14 14:25:57,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-08-14 14:25:57,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-08-14 14:25:57,930 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-08-14 14:25:57,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-08-14 14:25:57,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-08-14 14:25:57,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-08-14 14:25:57,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-08-14 14:25:57,932 INFO L153 SettingsManager]: * Use SBE=true
[2024-08-14 14:25:57,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-08-14 14:25:57,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-08-14 14:25:57,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-08-14 14:25:57,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-08-14 14:25:57,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-08-14 14:25:57,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-08-14 14:25:57,938 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-08-14 14:25:57,938 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-08-14 14:25:57,939 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-08-14 14:25:57,939 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-08-14 14:25:57,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-08-14 14:25:57,939 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-08-14 14:25:57,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-08-14 14:25:57,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-08-14 14:25:57,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-08-14 14:25:57,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-08-14 14:25:57,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-08-14 14:25:57,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-08-14 14:25:57,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-08-14 14:25:57,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-08-14 14:25:57,940 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-08-14 14:25:57,941 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-08-14 14:25:57,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-08-14 14:25:57,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-08-14 14:25:57,941 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-08-14 14:25:57,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-08-14 14:25:57,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-08-14 14:25:57,942 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2024-08-14 14:25:57,943 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements
[2024-08-14 14:25:58,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-08-14 14:25:58,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-08-14 14:25:58,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-08-14 14:25:58,231 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-08-14 14:25:58,232 INFO L274 PluginConnector]: CDTParser initialized
[2024-08-14 14:25:58,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c
[2024-08-14 14:25:59,610 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-08-14 14:25:59,817 INFO L384 CDTParser]: Found 1 translation units.
[2024-08-14 14:25:59,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c
[2024-08-14 14:25:59,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d1d3fbc/bd46023d22de4eef98dadf6683bfcf23/FLAG519d9c3b8
[2024-08-14 14:26:00,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d1d3fbc/bd46023d22de4eef98dadf6683bfcf23
[2024-08-14 14:26:00,211 INFO L270 PluginConnector]: Initializing Witness Parser...
[2024-08-14 14:26:00,212 INFO L274 PluginConnector]: Witness Parser initialized
[2024-08-14 14:26:00,212 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.mul5.yml/witness.yml
[2024-08-14 14:26:00,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-08-14 14:26:00,273 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements.
[2024-08-14 14:26:00,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-08-14 14:26:00,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-08-14 14:26:00,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-08-14 14:26:00,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:26:00" (1/2) ...
[2024-08-14 14:26:00,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7ae230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:00, skipping insertion in model container
[2024-08-14 14:26:00,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:26:00" (1/2) ...
[2024-08-14 14:26:00,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2626f62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:00, skipping insertion in model container
[2024-08-14 14:26:00,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:00" (2/2) ...
[2024-08-14 14:26:00,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7ae230 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:00, skipping insertion in model container
[2024-08-14 14:26:00,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:00" (2/2) ...
[2024-08-14 14:26:00,314 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-08-14 14:26:00,458 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.mul5.c[1244,1257]
[2024-08-14 14:26:00,529 INFO L207 PostProcessor]: Analyzing one entry point: main
[2024-08-14 14:26:00,546 INFO L200 MainTranslator]: Completed pre-run
[2024-08-14 14:26:00,558 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.mul5.c[1244,1257]
[2024-08-14 14:26:00,608 INFO L207 PostProcessor]: Analyzing one entry point: main
[2024-08-14 14:26:00,628 INFO L204 MainTranslator]: Completed translation
[2024-08-14 14:26:00,629 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:00 WrapperNode
[2024-08-14 14:26:00,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-08-14 14:26:00,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-08-14 14:26:00,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-08-14 14:26:00,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-08-14 14:26:00,641 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:26:00" (1/1) ...
[2024-08-14 14:26:00,641 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:26:00" (1/1) ...
[2024-08-14 14:26:00,655 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:26:00" (1/1) ...
[2024-08-14 14:26:00,685 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0].
[2024-08-14 14:26:00,686 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:26:00" (1/1) ...
[2024-08-14 14:26:00,686 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:26:00" (1/1) ...
[2024-08-14 14:26:00,699 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:26:00" (1/1) ...
[2024-08-14 14:26:00,704 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:26:00" (1/1) ...
[2024-08-14 14:26:00,708 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:26:00" (1/1) ...
[2024-08-14 14:26:00,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-08-14 14:26:00,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder----------------------------
[2024-08-14 14:26:00,715 INFO L270 PluginConnector]: Initializing IcfgBuilder...
[2024-08-14 14:26:00,715 INFO L274 PluginConnector]: IcfgBuilder initialized
[2024-08-14 14:26:00,716 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:26:00" (1/1) ...
[2024-08-14 14:26:00,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-08-14 14:26:00,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-08-14 14:26:00,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-08-14 14:26:00,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-08-14 14:26:00,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2024-08-14 14:26:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-08-14 14:26:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2024-08-14 14:26:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2024-08-14 14:26:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-08-14 14:26:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2024-08-14 14:26:00,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar
[2024-08-14 14:26:00,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort
[2024-08-14 14:26:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2024-08-14 14:26:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong
[2024-08-14 14:26:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2024-08-14 14:26:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2024-08-14 14:26:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2024-08-14 14:26:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-08-14 14:26:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2024-08-14 14:26:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-08-14 14:26:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2024-08-14 14:26:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2024-08-14 14:26:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-08-14 14:26:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-08-14 14:26:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-08-14 14:26:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0
[2024-08-14 14:26:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1
[2024-08-14 14:26:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2024-08-14 14:26:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2024-08-14 14:26:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-08-14 14:26:00,916 INFO L273 CfgBuilder]: Building ICFG
[2024-08-14 14:26:00,919 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-08-14 14:26:01,241 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live.
[2024-08-14 14:26:01,242 INFO L327 CfgBuilder]: Performing block encoding
[2024-08-14 14:26:01,250 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-08-14 14:26:01,250 INFO L354 CfgBuilder]: Removed 0 assume(true) statements.
[2024-08-14 14:26:01,251 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:26:01 BoogieIcfgContainer
[2024-08-14 14:26:01,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2024-08-14 14:26:01,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-08-14 14:26:01,253 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-08-14 14:26:01,256 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-08-14 14:26:01,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:26:00" (1/4) ...
[2024-08-14 14:26:01,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3d8c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:26:01, skipping insertion in model container
[2024-08-14 14:26:01,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:00" (2/4) ...
[2024-08-14 14:26:01,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3d8c1e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:26:01, skipping insertion in model container
[2024-08-14 14:26:01,258 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:26:00" (3/4) ...
[2024-08-14 14:26:01,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3d8c1e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:26:01, skipping insertion in model container
[2024-08-14 14:26:01,258 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:26:01" (4/4) ...
[2024-08-14 14:26:01,259 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul5.c
[2024-08-14 14:26:01,259 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness
[2024-08-14 14:26:01,288 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-08-14 14:26:01,288 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-08-14 14:26:01,308 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [9]
[2024-08-14 14:26:01,311 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:26:01,354 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 91 states to 54 states.
[2024-08-14 14:26:01,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-08-14 14:26:01,378 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;@6059cb29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-08-14 14:26:01,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-08-14 14:26:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states.
[2024-08-14 14:26:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-08-14 14:26:01,385 INFO L187 NwaCegarLoop]: Found error trace
[2024-08-14 14:26:01,385 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-08-14 14:26:01,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-08-14 14:26:01,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 14:26:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2090759925, now seen corresponding path program 1 times
[2024-08-14 14:26:01,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-08-14 14:26:01,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365820663]
[2024-08-14 14:26:01,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 14:26:01,403 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:26:01,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-08-14 14:26:01,406 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:26:01,407 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:26:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-08-14 14:26:01,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-08-14 14:26:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-08-14 14:26:02,003 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2024-08-14 14:26:02,005 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2024-08-14 14:26:02,007 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-08-14 14:26:02,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-08-14 14:26:02,210 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:26:02,213 INFO L445 BasicCegarLoop]: Path program histogram: [1]
[2024-08-14 14:26:02,216 INFO L196 ceAbstractionStarter]: Computing trace abstraction results
[2024-08-14 14:26:02,254 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:26:02 BoogieIcfgContainer
[2024-08-14 14:26:02,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-08-14 14:26:02,256 INFO L158 Benchmark]: Toolchain (without parser) took 1982.63ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 26.6MB in the beginning and 37.7MB in the end (delta: -11.2MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB.
[2024-08-14 14:26:02,256 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 54.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-08-14 14:26:02,256 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 56.6MB. Free memory was 28.8MB in the beginning and 28.7MB in the end (delta: 149.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-08-14 14:26:02,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.96ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 26.3MB in the beginning and 39.5MB in the end (delta: -13.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB.
[2024-08-14 14:26:02,257 INFO L158 Benchmark]: Boogie Preprocessor took 83.61ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 36.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-08-14 14:26:02,257 INFO L158 Benchmark]: IcfgBuilder took 536.36ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 28.3MB in the end (delta: 7.7MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB.
[2024-08-14 14:26:02,258 INFO L158 Benchmark]: TraceAbstraction took 1002.13ms. Allocated memory is still 71.3MB. Free memory was 27.6MB in the beginning and 37.7MB in the end (delta: -10.2MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB.
[2024-08-14 14:26:02,260 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.16ms. Allocated memory is still 56.6MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 54.9kB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Parser took 0.11ms. Allocated memory is still 56.6MB. Free memory was 28.8MB in the beginning and 28.7MB in the end (delta: 149.8kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 353.96ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 26.3MB in the beginning and 39.5MB in the end (delta: -13.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 83.61ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 36.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* IcfgBuilder took 536.36ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 28.3MB in the end (delta: 7.7MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 1002.13ms. Allocated memory is still 71.3MB. Free memory was 27.6MB in the beginning and 37.7MB in the end (delta: -10.2MB). Peak memory consumption was 3.9MB. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32);
[L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1);
[L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10);
[L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1);
[L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64);
[L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1);
[L38] const SORT_1 var_10 = 0;
[L39] const SORT_14 var_15 = 0;
[L40] const SORT_1 var_24 = 1;
[L41] const SORT_5 var_28 = 0;
[L42] const SORT_8 var_35 = 0;
[L43] const SORT_5 var_57 = 1;
[L44] const SORT_5 var_61 = 1000;
[L45] const SORT_5 var_63 = 3735928559;
[L46] const SORT_5 var_66 = 12245771;
[L48] SORT_1 input_2;
[L49] SORT_1 input_3;
[L50] SORT_1 input_4;
[L51] SORT_5 input_6;
[L52] SORT_5 input_7;
[L53] SORT_8 input_9;
[L55] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1;
[L56] SORT_14 state_16 = __VERIFIER_nondet_ulong() & mask_SORT_14;
[L57] SORT_14 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_14;
[L58] SORT_5 state_29 = __VERIFIER_nondet_uint() & mask_SORT_5;
[L59] SORT_5 state_31 = __VERIFIER_nondet_uint() & mask_SORT_5;
[L60] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8;
[L61] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1;
[L62] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1;
[L63] SORT_5 state_42 = __VERIFIER_nondet_uint() & mask_SORT_5;
[L64] SORT_5 state_44 = __VERIFIER_nondet_uint() & mask_SORT_5;
[L66] SORT_1 init_12_arg_1 = var_10;
[L67] state_11 = init_12_arg_1
[L68] SORT_14 init_17_arg_1 = var_15;
[L69] state_16 = init_17_arg_1
[L70] SORT_14 init_19_arg_1 = var_15;
[L71] state_18 = init_19_arg_1
[L72] SORT_5 init_30_arg_1 = var_28;
[L73] state_29 = init_30_arg_1
[L74] SORT_5 init_32_arg_1 = var_28;
[L75] state_31 = init_32_arg_1
[L76] SORT_8 init_37_arg_1 = var_35;
[L77] state_36 = init_37_arg_1
[L78] SORT_1 init_39_arg_1 = var_24;
[L79] state_38 = init_39_arg_1
[L80] SORT_1 init_41_arg_1 = var_24;
[L81] state_40 = init_41_arg_1
[L82] SORT_5 init_43_arg_1 = var_28;
[L83] state_42 = init_43_arg_1
[L84] SORT_5 init_45_arg_1 = var_28;
[L85] state_44 = init_45_arg_1
VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=-559038737, var_66=12245771]
[L88] input_2 = __VERIFIER_nondet_uchar()
[L89] input_3 = __VERIFIER_nondet_uchar()
[L90] input_3 = input_3 & mask_SORT_1
[L91] input_4 = __VERIFIER_nondet_uchar()
[L92] input_4 = input_4 & mask_SORT_1
[L93] input_6 = __VERIFIER_nondet_uint()
[L94] input_6 = input_6 & mask_SORT_5
[L95] input_7 = __VERIFIER_nondet_uint()
[L96] input_7 = input_7 & mask_SORT_5
[L97] input_9 = __VERIFIER_nondet_ushort()
[L100] SORT_1 var_13_arg_0 = state_11;
[L101] SORT_1 var_13 = ~var_13_arg_0;
[L102] SORT_14 var_20_arg_0 = state_16;
[L103] SORT_14 var_20_arg_1 = state_18;
[L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1;
[L105] SORT_1 var_21_arg_0 = var_13;
[L106] SORT_1 var_21_arg_1 = var_20;
[L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1;
[L108] SORT_1 var_25_arg_0 = var_21;
[L109] SORT_1 var_25 = ~var_25_arg_0;
[L110] SORT_1 var_26_arg_0 = var_24;
[L111] SORT_1 var_26_arg_1 = var_25;
[L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1;
[L113] var_26 = var_26 & mask_SORT_1
[L114] SORT_1 bad_27_arg_0 = var_26;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=-559038737, var_66=12245771]
[L115] CALL __VERIFIER_assert(!(bad_27_arg_0))
VAL [\old(cond)=1]
[L21] COND FALSE !(!(cond))
VAL [\old(cond)=1]
[L115] RET __VERIFIER_assert(!(bad_27_arg_0))
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=-559038737, var_66=12245771]
[L117] SORT_1 next_51_arg_1 = var_24;
[L118] SORT_1 var_33_arg_0 = state_11;
[L119] SORT_1 var_33 = ~var_33_arg_0;
[L120] var_33 = var_33 & mask_SORT_1
[L121] SORT_5 var_52_arg_0 = state_29;
[L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5
[L123] SORT_14 var_52 = var_52_arg_0;
[L124] SORT_5 var_53_arg_0 = state_31;
[L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5
[L126] SORT_14 var_53 = var_53_arg_0;
[L127] SORT_14 var_54_arg_0 = var_52;
[L128] SORT_14 var_54_arg_1 = var_53;
[L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1;
[L130] SORT_1 var_55_arg_0 = var_33;
[L131] SORT_14 var_55_arg_1 = var_15;
[L132] SORT_14 var_55_arg_2 = var_54;
[L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2;
[L134] var_55 = var_55 & mask_SORT_14
[L135] SORT_14 next_56_arg_1 = var_55;
[L136] SORT_1 var_70_arg_0 = state_38;
[L137] SORT_1 var_70_arg_1 = state_40;
[L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1;
[L139] var_70 = var_70 & mask_SORT_1
[L140] SORT_8 var_60_arg_0 = state_36;
[L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8
[L142] SORT_5 var_60 = var_60_arg_0;
[L143] SORT_5 var_62_arg_0 = var_60;
[L144] SORT_5 var_62_arg_1 = var_61;
[L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1;
[L146] SORT_5 var_64_arg_0 = input_6;
[L147] SORT_5 var_64_arg_1 = var_63;
[L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1;
[L149] SORT_1 var_65_arg_0 = var_62;
[L150] SORT_1 var_65_arg_1 = var_64;
[L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1;
[L152] SORT_5 var_67_arg_0 = input_7;
[L153] SORT_5 var_67_arg_1 = var_66;
[L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1;
[L155] SORT_1 var_68_arg_0 = var_65;
[L156] SORT_1 var_68_arg_1 = var_67;
[L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1;
[L158] var_68 = var_68 & mask_SORT_1
[L159] SORT_5 var_46_arg_0 = state_42;
[L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5
[L161] SORT_14 var_46 = var_46_arg_0;
[L162] SORT_5 var_47_arg_0 = state_44;
[L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5
[L164] SORT_14 var_47 = var_47_arg_0;
[L165] SORT_14 var_48_arg_0 = var_46;
[L166] SORT_14 var_48_arg_1 = var_47;
[L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1;
[L168] SORT_5 var_58_arg_0 = var_57;
[L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5
[L170] SORT_14 var_58 = var_58_arg_0;
[L171] SORT_14 var_59_arg_0 = var_48;
[L172] SORT_14 var_59_arg_1 = var_58;
[L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1;
[L174] SORT_1 var_69_arg_0 = var_68;
[L175] SORT_14 var_69_arg_1 = var_59;
[L176] SORT_14 var_69_arg_2 = var_48;
[L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2;
[L178] SORT_1 var_71_arg_0 = var_70;
[L179] SORT_14 var_71_arg_1 = var_69;
[L180] SORT_14 var_71_arg_2 = state_18;
[L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2;
[L182] SORT_1 var_72_arg_0 = var_33;
[L183] SORT_14 var_72_arg_1 = var_15;
[L184] SORT_14 var_72_arg_2 = var_71;
[L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2;
[L186] var_72 = var_72 & mask_SORT_14
[L187] SORT_14 next_73_arg_1 = var_72;
[L188] SORT_1 var_74_arg_0 = input_3;
[L189] SORT_5 var_74_arg_1 = input_6;
[L190] SORT_5 var_74_arg_2 = state_29;
[L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2;
[L192] SORT_1 var_75_arg_0 = var_33;
[L193] SORT_5 var_75_arg_1 = var_28;
[L194] SORT_5 var_75_arg_2 = var_74;
[L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2;
[L196] SORT_5 next_76_arg_1 = var_75;
[L197] SORT_1 var_77_arg_0 = input_4;
[L198] SORT_5 var_77_arg_1 = input_7;
[L199] SORT_5 var_77_arg_2 = state_31;
[L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2;
[L201] SORT_1 var_78_arg_0 = var_33;
[L202] SORT_5 var_78_arg_1 = var_28;
[L203] SORT_5 var_78_arg_2 = var_77;
[L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2;
[L205] SORT_5 next_79_arg_1 = var_78;
[L206] SORT_1 var_80_arg_0 = var_33;
[L207] SORT_8 var_80_arg_1 = input_9;
[L208] SORT_8 var_80_arg_2 = state_36;
[L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2;
[L210] SORT_8 next_81_arg_1 = var_80;
[L211] SORT_1 var_82_arg_0 = var_33;
[L212] SORT_1 var_82_arg_1 = var_24;
[L213] SORT_1 var_82_arg_2 = input_3;
[L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2;
[L215] SORT_1 next_83_arg_1 = var_82;
[L216] SORT_1 var_84_arg_0 = var_33;
[L217] SORT_1 var_84_arg_1 = var_24;
[L218] SORT_1 var_84_arg_2 = input_4;
[L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2;
[L220] SORT_1 next_85_arg_1 = var_84;
[L221] SORT_1 var_86_arg_0 = input_3;
[L222] SORT_5 var_86_arg_1 = input_6;
[L223] SORT_5 var_86_arg_2 = state_42;
[L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2;
[L225] SORT_1 var_87_arg_0 = var_33;
[L226] SORT_5 var_87_arg_1 = var_28;
[L227] SORT_5 var_87_arg_2 = var_86;
[L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2;
[L229] SORT_5 next_88_arg_1 = var_87;
[L230] SORT_1 var_89_arg_0 = input_4;
[L231] SORT_5 var_89_arg_1 = input_7;
[L232] SORT_5 var_89_arg_2 = state_44;
[L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2;
[L234] SORT_1 var_90_arg_0 = var_33;
[L235] SORT_5 var_90_arg_1 = var_28;
[L236] SORT_5 var_90_arg_2 = var_89;
[L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2;
[L238] SORT_5 next_91_arg_1 = var_90;
[L240] state_11 = next_51_arg_1
[L241] state_16 = next_56_arg_1
[L242] state_18 = next_73_arg_1
[L243] state_29 = next_76_arg_1
[L244] state_31 = next_79_arg_1
[L245] state_36 = next_81_arg_1
[L246] state_38 = next_83_arg_1
[L247] state_40 = next_85_arg_1
[L248] state_42 = next_88_arg_1
[L249] state_44 = next_91_arg_1
[L88] input_2 = __VERIFIER_nondet_uchar()
[L89] input_3 = __VERIFIER_nondet_uchar()
[L90] input_3 = input_3 & mask_SORT_1
[L91] input_4 = __VERIFIER_nondet_uchar()
[L92] input_4 = input_4 & mask_SORT_1
[L93] input_6 = __VERIFIER_nondet_uint()
[L94] input_6 = input_6 & mask_SORT_5
[L95] input_7 = __VERIFIER_nondet_uint()
[L96] input_7 = input_7 & mask_SORT_5
[L97] input_9 = __VERIFIER_nondet_ushort()
[L100] SORT_1 var_13_arg_0 = state_11;
[L101] SORT_1 var_13 = ~var_13_arg_0;
[L102] SORT_14 var_20_arg_0 = state_16;
[L103] SORT_14 var_20_arg_1 = state_18;
[L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1;
[L105] SORT_1 var_21_arg_0 = var_13;
[L106] SORT_1 var_21_arg_1 = var_20;
[L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1;
[L108] SORT_1 var_25_arg_0 = var_21;
[L109] SORT_1 var_25 = ~var_25_arg_0;
[L110] SORT_1 var_26_arg_0 = var_24;
[L111] SORT_1 var_26_arg_1 = var_25;
[L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1;
[L113] var_26 = var_26 & mask_SORT_1
[L114] SORT_1 bad_27_arg_0 = var_26;
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=-559038737, input_7=12245771, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=1008, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=-559038737, var_66=12245771]
[L115] CALL __VERIFIER_assert(!(bad_27_arg_0))
VAL [\old(cond)=1]
[L21] COND FALSE !(!(cond))
VAL [\old(cond)=1]
[L115] RET __VERIFIER_assert(!(bad_27_arg_0))
VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=-559038737, input_7=12245771, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=1008, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=-559038737, var_66=12245771]
[L117] SORT_1 next_51_arg_1 = var_24;
[L118] SORT_1 var_33_arg_0 = state_11;
[L119] SORT_1 var_33 = ~var_33_arg_0;
[L120] var_33 = var_33 & mask_SORT_1
[L121] SORT_5 var_52_arg_0 = state_29;
[L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5
[L123] SORT_14 var_52 = var_52_arg_0;
[L124] SORT_5 var_53_arg_0 = state_31;
[L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5
[L126] SORT_14 var_53 = var_53_arg_0;
[L127] SORT_14 var_54_arg_0 = var_52;
[L128] SORT_14 var_54_arg_1 = var_53;
[L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1;
[L130] SORT_1 var_55_arg_0 = var_33;
[L131] SORT_14 var_55_arg_1 = var_15;
[L132] SORT_14 var_55_arg_2 = var_54;
[L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2;
[L134] var_55 = var_55 & mask_SORT_14
[L135] SORT_14 next_56_arg_1 = var_55;
[L136] SORT_1 var_70_arg_0 = state_38;
[L137] SORT_1 var_70_arg_1 = state_40;
[L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1;
[L139] var_70 = var_70 & mask_SORT_1
[L140] SORT_8 var_60_arg_0 = state_36;
[L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8
[L142] SORT_5 var_60 = var_60_arg_0;
[L143] SORT_5 var_62_arg_0 = var_60;
[L144] SORT_5 var_62_arg_1 = var_61;
[L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1;
[L146] SORT_5 var_64_arg_0 = input_6;
[L147] SORT_5 var_64_arg_1 = var_63;
[L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1;
[L149] SORT_1 var_65_arg_0 = var_62;
[L150] SORT_1 var_65_arg_1 = var_64;
[L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1;
[L152] SORT_5 var_67_arg_0 = input_7;
[L153] SORT_5 var_67_arg_1 = var_66;
[L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1;
[L155] SORT_1 var_68_arg_0 = var_65;
[L156] SORT_1 var_68_arg_1 = var_67;
[L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1;
[L158] var_68 = var_68 & mask_SORT_1
[L159] SORT_5 var_46_arg_0 = state_42;
[L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5
[L161] SORT_14 var_46 = var_46_arg_0;
[L162] SORT_5 var_47_arg_0 = state_44;
[L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5
[L164] SORT_14 var_47 = var_47_arg_0;
[L165] SORT_14 var_48_arg_0 = var_46;
[L166] SORT_14 var_48_arg_1 = var_47;
[L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1;
[L168] SORT_5 var_58_arg_0 = var_57;
[L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5
[L170] SORT_14 var_58 = var_58_arg_0;
[L171] SORT_14 var_59_arg_0 = var_48;
[L172] SORT_14 var_59_arg_1 = var_58;
[L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1;
[L174] SORT_1 var_69_arg_0 = var_68;
[L175] SORT_14 var_69_arg_1 = var_59;
[L176] SORT_14 var_69_arg_2 = var_48;
[L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2;
[L178] SORT_1 var_71_arg_0 = var_70;
[L179] SORT_14 var_71_arg_1 = var_69;
[L180] SORT_14 var_71_arg_2 = state_18;
[L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2;
[L182] SORT_1 var_72_arg_0 = var_33;
[L183] SORT_14 var_72_arg_1 = var_15;
[L184] SORT_14 var_72_arg_2 = var_71;
[L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2;
[L186] var_72 = var_72 & mask_SORT_14
[L187] SORT_14 next_73_arg_1 = var_72;
[L188] SORT_1 var_74_arg_0 = input_3;
[L189] SORT_5 var_74_arg_1 = input_6;
[L190] SORT_5 var_74_arg_2 = state_29;
[L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2;
[L192] SORT_1 var_75_arg_0 = var_33;
[L193] SORT_5 var_75_arg_1 = var_28;
[L194] SORT_5 var_75_arg_2 = var_74;
[L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2;
[L196] SORT_5 next_76_arg_1 = var_75;
[L197] SORT_1 var_77_arg_0 = input_4;
[L198] SORT_5 var_77_arg_1 = input_7;
[L199] SORT_5 var_77_arg_2 = state_31;
[L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2;
[L201] SORT_1 var_78_arg_0 = var_33;
[L202] SORT_5 var_78_arg_1 = var_28;
[L203] SORT_5 var_78_arg_2 = var_77;
[L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2;
[L205] SORT_5 next_79_arg_1 = var_78;
[L206] SORT_1 var_80_arg_0 = var_33;
[L207] SORT_8 var_80_arg_1 = input_9;
[L208] SORT_8 var_80_arg_2 = state_36;
[L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2;
[L210] SORT_8 next_81_arg_1 = var_80;
[L211] SORT_1 var_82_arg_0 = var_33;
[L212] SORT_1 var_82_arg_1 = var_24;
[L213] SORT_1 var_82_arg_2 = input_3;
[L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2;
[L215] SORT_1 next_83_arg_1 = var_82;
[L216] SORT_1 var_84_arg_0 = var_33;
[L217] SORT_1 var_84_arg_1 = var_24;
[L218] SORT_1 var_84_arg_2 = input_4;
[L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2;
[L220] SORT_1 next_85_arg_1 = var_84;
[L221] SORT_1 var_86_arg_0 = input_3;
[L222] SORT_5 var_86_arg_1 = input_6;
[L223] SORT_5 var_86_arg_2 = state_42;
[L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2;
[L225] SORT_1 var_87_arg_0 = var_33;
[L226] SORT_5 var_87_arg_1 = var_28;
[L227] SORT_5 var_87_arg_2 = var_86;
[L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2;
[L229] SORT_5 next_88_arg_1 = var_87;
[L230] SORT_1 var_89_arg_0 = input_4;
[L231] SORT_5 var_89_arg_1 = input_7;
[L232] SORT_5 var_89_arg_2 = state_44;
[L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2;
[L234] SORT_1 var_90_arg_0 = var_33;
[L235] SORT_5 var_90_arg_1 = var_28;
[L236] SORT_5 var_90_arg_2 = var_89;
[L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2;
[L238] SORT_5 next_91_arg_1 = var_90;
[L240] state_11 = next_51_arg_1
[L241] state_16 = next_56_arg_1
[L242] state_18 = next_73_arg_1
[L243] state_29 = next_76_arg_1
[L244] state_31 = next_79_arg_1
[L245] state_36 = next_81_arg_1
[L246] state_38 = next_83_arg_1
[L247] state_40 = next_85_arg_1
[L248] state_42 = next_88_arg_1
[L249] state_44 = next_91_arg_1
[L88] input_2 = __VERIFIER_nondet_uchar()
[L89] input_3 = __VERIFIER_nondet_uchar()
[L90] input_3 = input_3 & mask_SORT_1
[L91] input_4 = __VERIFIER_nondet_uchar()
[L92] input_4 = input_4 & mask_SORT_1
[L93] input_6 = __VERIFIER_nondet_uint()
[L94] input_6 = input_6 & mask_SORT_5
[L95] input_7 = __VERIFIER_nondet_uint()
[L96] input_7 = input_7 & mask_SORT_5
[L97] input_9 = __VERIFIER_nondet_ushort()
[L100] SORT_1 var_13_arg_0 = state_11;
[L101] SORT_1 var_13 = ~var_13_arg_0;
[L102] SORT_14 var_20_arg_0 = state_16;
[L103] SORT_14 var_20_arg_1 = state_18;
[L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1;
[L105] SORT_1 var_21_arg_0 = var_13;
[L106] SORT_1 var_21_arg_1 = var_20;
[L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1;
[L108] SORT_1 var_25_arg_0 = var_21;
[L109] SORT_1 var_25 = ~var_25_arg_0;
[L110] SORT_1 var_26_arg_0 = var_24;
[L111] SORT_1 var_26_arg_1 = var_25;
[L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1;
[L113] var_26 = var_26 & mask_SORT_1
[L114] SORT_1 bad_27_arg_0 = var_26;
VAL [bad_27_arg_0=1, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=1, state_29=0, state_31=0, state_36=1008, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=-559038737, var_66=12245771]
[L115] CALL __VERIFIER_assert(!(bad_27_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.9s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred 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.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 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:26:02,294 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