./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.eq_sdp_v3.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.eq_sdp_v3.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.eq_sdp_v3.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:24:53,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:24:53,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-14 14:24:53,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:24:53,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:24:53,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:24:53,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:24:53,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:24:53,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:24:53,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:24:53,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:24:53,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:24:53,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:24:53,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:24:53,372 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:24:53,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:24:53,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:24:53,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:24:53,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:24:53,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:24:53,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:24:53,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:24:53,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:24:53,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:24:53,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:24:53,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:24:53,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:24:53,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:24:53,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:24:53,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:24:53,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:24:53,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:24:53,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:24:53,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:24:53,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:24:53,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:24:53,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:24:53,381 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:24:53,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:24:53,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:24:53,384 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:24:53,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:24:53,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:24:53,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:24:53,618 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:24:53,618 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:24:53,619 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.eq_sdp_v3.yml/witness.yml [2024-08-14 14:24:53,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:24:53,722 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:24:53,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-08-14 14:24:54,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:24:55,100 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:24:55,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-08-14 14:24:55,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664acd155/4bbe6e89072441a5b560b6ebbde5ccfd/FLAGd613c184c [2024-08-14 14:24:55,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664acd155/4bbe6e89072441a5b560b6ebbde5ccfd [2024-08-14 14:24:55,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:24:55,478 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:24:55,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:24:55,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:24:55,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:24:55,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:53" (1/2) ... [2024-08-14 14:24:55,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b426667 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:55, skipping insertion in model container [2024-08-14 14:24:55,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:53" (1/2) ... [2024-08-14 14:24:55,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@59265362 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:55, skipping insertion in model container [2024-08-14 14:24:55,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:24:55" (2/2) ... [2024-08-14 14:24:55,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b426667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55, skipping insertion in model container [2024-08-14 14:24:55,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:24:55" (2/2) ... [2024-08-14 14:24:55,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:24:55,628 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.eq_sdp_v3.c[1249,1262] [2024-08-14 14:24:55,677 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:24:55,686 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:24:55,699 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.eq_sdp_v3.c[1249,1262] [2024-08-14 14:24:55,764 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:24:55,780 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:24:55,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55 WrapperNode [2024-08-14 14:24:55,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:24:55,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:24:55,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:24:55,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:24:55,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55" (1/1) ... [2024-08-14 14:24:55,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55" (1/1) ... [2024-08-14 14:24:55,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55" (1/1) ... [2024-08-14 14:24:55,840 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:24:55,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55" (1/1) ... [2024-08-14 14:24:55,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55" (1/1) ... [2024-08-14 14:24:55,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55" (1/1) ... [2024-08-14 14:24:55,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55" (1/1) ... [2024-08-14 14:24:55,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55" (1/1) ... [2024-08-14 14:24:55,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:24:55,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:24:55,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:24:55,864 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:24:55,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55" (1/1) ... [2024-08-14 14:24:55,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:24:55,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:55,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:24:55,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:24:55,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:24:55,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:24:55,938 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:24:55,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:24:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:24:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:24:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:24:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:24:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:24:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:24:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:24:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:24:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:24:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:24:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:24:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:24:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:24:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:24:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:24:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:24:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:24:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:24:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:24:56,046 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:24:56,048 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:24:56,517 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-08-14 14:24:56,517 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:24:56,525 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:24:56,525 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:24:56,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:24:56 BoogieIcfgContainer [2024-08-14 14:24:56,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:24:56,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:24:56,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:24:56,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:24:56,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:53" (1/4) ... [2024-08-14 14:24:56,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312b0fd0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:24:56, skipping insertion in model container [2024-08-14 14:24:56,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:24:55" (2/4) ... [2024-08-14 14:24:56,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312b0fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:24:56, skipping insertion in model container [2024-08-14 14:24:56,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:55" (3/4) ... [2024-08-14 14:24:56,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312b0fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:24:56, skipping insertion in model container [2024-08-14 14:24:56,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:24:56" (4/4) ... [2024-08-14 14:24:56,552 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v3.c [2024-08-14 14:24:56,552 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:24:56,587 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:24:56,610 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:24:56,645 INFO L92 WitnessUtils]: Constructing product of automaton with 84 states and violation witness of the following lengths: [12] [2024-08-14 14:24:56,654 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 84 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 77 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:24:56,772 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 383 states to 335 states. [2024-08-14 14:24:56,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:24:56,804 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;@281c53f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:24:56,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:24:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2024-08-14 14:24:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-08-14 14:24:56,818 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:56,819 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:56,820 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:56,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1863210030, now seen corresponding path program 1 times [2024-08-14 14:24:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:56,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025595939] [2024-08-14 14:24:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:56,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:24:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:24:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:24:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-08-14 14:24:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025595939] [2024-08-14 14:24:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025595939] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:57,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:24:57,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:24:57,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194918984] [2024-08-14 14:24:57,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:57,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:24:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:24:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:24:57,978 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:24:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:58,041 INFO L93 Difference]: Finished difference Result 278 states and 418 transitions. [2024-08-14 14:24:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:24:58,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 120 [2024-08-14 14:24:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:58,049 INFO L225 Difference]: With dead ends: 278 [2024-08-14 14:24:58,049 INFO L226 Difference]: Without dead ends: 275 [2024-08-14 14:24:58,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:24:58,055 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 23 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:58,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 576 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:24:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-08-14 14:24:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 167. [2024-08-14 14:24:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 156 states have internal predecessors, (244), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:24:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 255 transitions. [2024-08-14 14:24:58,096 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 255 transitions. Word has length 120 [2024-08-14 14:24:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:58,096 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 255 transitions. [2024-08-14 14:24:58,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:24:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 255 transitions. [2024-08-14 14:24:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-08-14 14:24:58,098 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:58,098 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:58,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:24:58,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:58,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 285153321, now seen corresponding path program 1 times [2024-08-14 14:24:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87446350] [2024-08-14 14:24:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:24:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:24:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:24:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-08-14 14:24:58,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:58,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87446350] [2024-08-14 14:24:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87446350] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:58,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:24:58,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:24:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097060936] [2024-08-14 14:24:58,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:58,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:24:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:58,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:24:58,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:24:58,549 INFO L87 Difference]: Start difference. First operand 167 states and 255 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:24:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:58,573 INFO L93 Difference]: Finished difference Result 175 states and 263 transitions. [2024-08-14 14:24:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:24:58,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 121 [2024-08-14 14:24:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:58,577 INFO L225 Difference]: With dead ends: 175 [2024-08-14 14:24:58,577 INFO L226 Difference]: Without dead ends: 175 [2024-08-14 14:24:58,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:24:58,579 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:58,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:24:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-08-14 14:24:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2024-08-14 14:24:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 161 states have (on average 1.5527950310559007) internal successors, (250), 162 states have internal predecessors, (250), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:24:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 261 transitions. [2024-08-14 14:24:58,598 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 261 transitions. Word has length 121 [2024-08-14 14:24:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:58,599 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 261 transitions. [2024-08-14 14:24:58,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:24:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 261 transitions. [2024-08-14 14:24:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-08-14 14:24:58,603 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:58,603 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:58,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:24:58,604 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:58,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:58,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1331643574, now seen corresponding path program 1 times [2024-08-14 14:24:58,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:58,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779991059] [2024-08-14 14:24:58,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:58,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:59,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:24:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:24:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:24:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-08-14 14:24:59,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779991059] [2024-08-14 14:24:59,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779991059] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:24:59,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652016086] [2024-08-14 14:24:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:59,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:59,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:59,377 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:24:59,380 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:24:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:59,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-14 14:24:59,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:24:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-08-14 14:24:59,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-08-14 14:25:00,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652016086] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:00,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:00,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2024-08-14 14:25:00,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381260862] [2024-08-14 14:25:00,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:00,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-14 14:25:00,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:00,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-14 14:25:00,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:25:00,189 INFO L87 Difference]: Start difference. First operand 173 states and 261 transitions. Second operand has 11 states, 11 states have (on average 17.272727272727273) internal successors, (190), 11 states have internal predecessors, (190), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-08-14 14:25:00,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:00,452 INFO L93 Difference]: Finished difference Result 227 states and 317 transitions. [2024-08-14 14:25:00,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 14:25:00,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.272727272727273) internal successors, (190), 11 states have internal predecessors, (190), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 122 [2024-08-14 14:25:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:00,453 INFO L225 Difference]: With dead ends: 227 [2024-08-14 14:25:00,454 INFO L226 Difference]: Without dead ends: 167 [2024-08-14 14:25:00,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-08-14 14:25:00,455 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 437 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:00,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 663 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:25:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-08-14 14:25:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-08-14 14:25:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 155 states have (on average 1.5161290322580645) internal successors, (235), 156 states have internal predecessors, (235), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:25:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2024-08-14 14:25:00,465 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 122 [2024-08-14 14:25:00,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:00,466 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2024-08-14 14:25:00,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.272727272727273) internal successors, (190), 11 states have internal predecessors, (190), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-08-14 14:25:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2024-08-14 14:25:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-08-14 14:25:00,468 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:00,469 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:00,483 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:00,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:00,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:00,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash 688987941, now seen corresponding path program 1 times [2024-08-14 14:25:00,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:00,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85933149] [2024-08-14 14:25:00,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:00,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:01,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-08-14 14:25:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:01,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-08-14 14:25:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-08-14 14:25:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-08-14 14:25:01,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:01,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85933149] [2024-08-14 14:25:01,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85933149] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:25:01,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:25:01,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 14:25:01,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634794213] [2024-08-14 14:25:01,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:25:01,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:25:01,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:01,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:25:01,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:25:01,262 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:01,379 INFO L93 Difference]: Finished difference Result 167 states and 245 transitions. [2024-08-14 14:25:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:25:01,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 126 [2024-08-14 14:25:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:01,380 INFO L225 Difference]: With dead ends: 167 [2024-08-14 14:25:01,380 INFO L226 Difference]: Without dead ends: 167 [2024-08-14 14:25:01,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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:01,381 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 145 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:01,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 242 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:25:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-08-14 14:25:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-08-14 14:25:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 155 states have (on average 1.5096774193548388) internal successors, (234), 156 states have internal predecessors, (234), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:25:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2024-08-14 14:25:01,391 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 126 [2024-08-14 14:25:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:01,392 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2024-08-14 14:25:01,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2024-08-14 14:25:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-08-14 14:25:01,393 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:01,393 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:01,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-14 14:25:01,394 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:01,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:01,394 INFO L85 PathProgramCache]: Analyzing trace with hash 205312614, now seen corresponding path program 1 times [2024-08-14 14:25:01,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:01,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964340590] [2024-08-14 14:25:01,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:01,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-08-14 14:25:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-08-14 14:25:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-08-14 14:25:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:25:02,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:02,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964340590] [2024-08-14 14:25:02,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964340590] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:02,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826869506] [2024-08-14 14:25:02,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:02,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:02,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:02,620 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:02,621 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:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 22 conjunts are in the unsatisfiable core [2024-08-14 14:25:02,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:25:03,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:25:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826869506] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:03,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:03,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-08-14 14:25:03,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30365129] [2024-08-14 14:25:03,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:03,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-08-14 14:25:03,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:03,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-08-14 14:25:03,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-08-14 14:25:03,605 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand has 19 states, 19 states have (on average 11.736842105263158) internal successors, (223), 19 states have internal predecessors, (223), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-08-14 14:25:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:04,406 INFO L93 Difference]: Finished difference Result 765 states and 1159 transitions. [2024-08-14 14:25:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-08-14 14:25:04,407 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.736842105263158) internal successors, (223), 19 states have internal predecessors, (223), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 126 [2024-08-14 14:25:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:04,410 INFO L225 Difference]: With dead ends: 765 [2024-08-14 14:25:04,410 INFO L226 Difference]: Without dead ends: 765 [2024-08-14 14:25:04,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=384, Invalid=1422, Unknown=0, NotChecked=0, Total=1806 [2024-08-14 14:25:04,411 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 874 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:04,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 718 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:25:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-08-14 14:25:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 399. [2024-08-14 14:25:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 377 states have (on average 1.506631299734748) internal successors, (568), 381 states have internal predecessors, (568), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-08-14 14:25:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 599 transitions. [2024-08-14 14:25:04,430 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 599 transitions. Word has length 126 [2024-08-14 14:25:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:04,431 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 599 transitions. [2024-08-14 14:25:04,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.736842105263158) internal successors, (223), 19 states have internal predecessors, (223), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-08-14 14:25:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 599 transitions. [2024-08-14 14:25:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-08-14 14:25:04,433 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:04,433 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:04,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-08-14 14:25:04,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:04,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:04,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:04,639 INFO L85 PathProgramCache]: Analyzing trace with hash 875821964, now seen corresponding path program 1 times [2024-08-14 14:25:04,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:04,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913449750] [2024-08-14 14:25:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:04,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:05,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-08-14 14:25:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-08-14 14:25:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-08-14 14:25:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 78 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-08-14 14:25:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913449750] [2024-08-14 14:25:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913449750] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458085247] [2024-08-14 14:25:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:05,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:05,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:05,859 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:05,863 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:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:06,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-14 14:25:06,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-08-14 14:25:06,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-08-14 14:25:07,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458085247] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:07,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:07,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 20 [2024-08-14 14:25:07,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440665724] [2024-08-14 14:25:07,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:07,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-08-14 14:25:07,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:07,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-08-14 14:25:07,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-08-14 14:25:07,571 INFO L87 Difference]: Start difference. First operand 399 states and 599 transitions. Second operand has 20 states, 20 states have (on average 9.1) internal successors, (182), 20 states have internal predecessors, (182), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-08-14 14:25:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:08,900 INFO L93 Difference]: Finished difference Result 930 states and 1354 transitions. [2024-08-14 14:25:08,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-08-14 14:25:08,901 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.1) internal successors, (182), 20 states have internal predecessors, (182), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 128 [2024-08-14 14:25:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:08,905 INFO L225 Difference]: With dead ends: 930 [2024-08-14 14:25:08,905 INFO L226 Difference]: Without dead ends: 930 [2024-08-14 14:25:08,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=2645, Unknown=0, NotChecked=0, Total=3080 [2024-08-14 14:25:08,909 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 200 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:08,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1108 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-08-14 14:25:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-08-14 14:25:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 755. [2024-08-14 14:25:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 717 states have (on average 1.4504881450488145) internal successors, (1040), 726 states have internal predecessors, (1040), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (31), 22 states have call predecessors, (31), 31 states have call successors, (31) [2024-08-14 14:25:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1103 transitions. [2024-08-14 14:25:08,928 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1103 transitions. Word has length 128 [2024-08-14 14:25:08,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:08,929 INFO L495 AbstractCegarLoop]: Abstraction has 755 states and 1103 transitions. [2024-08-14 14:25:08,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.1) internal successors, (182), 20 states have internal predecessors, (182), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-08-14 14:25:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1103 transitions. [2024-08-14 14:25:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-08-14 14:25:08,931 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:08,931 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,947 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:09,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:09,133 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:09,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1180626355, now seen corresponding path program 1 times [2024-08-14 14:25:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086316625] [2024-08-14 14:25:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:09,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:25:09,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:25:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:25:09,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:25:09,620 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:25:09,621 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:25:09,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 14:25:09,625 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:09,629 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:25:09,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:25:09 BoogieIcfgContainer [2024-08-14 14:25:09,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:25:09,706 INFO L158 Benchmark]: Toolchain (without parser) took 14226.06ms. Allocated memory was 207.6MB in the beginning and 446.7MB in the end (delta: 239.1MB). Free memory was 177.6MB in the beginning and 209.1MB in the end (delta: -31.5MB). Peak memory consumption was 208.6MB. Max. memory is 16.1GB. [2024-08-14 14:25:09,707 INFO L158 Benchmark]: Witness Parser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:25:09,707 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 134.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:25:09,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.45ms. Allocated memory is still 207.6MB. Free memory was 177.6MB in the beginning and 159.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-08-14 14:25:09,707 INFO L158 Benchmark]: Boogie Preprocessor took 82.34ms. Allocated memory is still 207.6MB. Free memory was 159.9MB in the beginning and 155.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-14 14:25:09,708 INFO L158 Benchmark]: IcfgBuilder took 661.95ms. Allocated memory is still 207.6MB. Free memory was 155.7MB in the beginning and 104.4MB in the end (delta: 51.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-08-14 14:25:09,708 INFO L158 Benchmark]: TraceAbstraction took 13164.80ms. Allocated memory was 207.6MB in the beginning and 446.7MB in the end (delta: 239.1MB). Free memory was 175.1MB in the beginning and 209.1MB in the end (delta: -34.0MB). Peak memory consumption was 205.1MB. Max. memory is 16.1GB. [2024-08-14 14:25:09,709 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.08ms. Allocated memory is still 134.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.45ms. Allocated memory is still 207.6MB. Free memory was 177.6MB in the beginning and 159.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.34ms. Allocated memory is still 207.6MB. Free memory was 159.9MB in the beginning and 155.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 661.95ms. Allocated memory is still 207.6MB. Free memory was 155.7MB in the beginning and 104.4MB in the end (delta: 51.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13164.80ms. Allocated memory was 207.6MB in the beginning and 446.7MB in the end (delta: 239.1MB). Free memory was 175.1MB in the beginning and 209.1MB in the end (delta: -34.0MB). Peak memory consumption was 205.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] EXPR input_7 & mask_SORT_5 [L88] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] EXPR input_8 & mask_SORT_5 [L90] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] EXPR input_9 & mask_SORT_5 [L92] EXPR input_9 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] EXPR var_20 & mask_SORT_5 [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_53=0] [L114] EXPR var_53 & mask_SORT_1 [L114] EXPR var_53 & mask_SORT_1 VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0] [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; VAL [bad_21_arg_0=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_59=0] [L133] EXPR var_59 & mask_SORT_1 [L133] EXPR var_59 & mask_SORT_1 VAL [bad_21_arg_0=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0] [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, state_22=0, state_24=0, state_29=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_73=0] [L169] EXPR var_73 & mask_SORT_5 [L169] EXPR var_73 & mask_SORT_5 VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, state_22=0, state_24=0, state_29=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0] [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, next_74_arg_1=0, state_22=0, state_24=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_77=-1] [L173] EXPR var_77 & mask_SORT_5 VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, next_74_arg_1=0, state_22=0, state_24=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_77=-1] [L173] EXPR var_77 & mask_SORT_5 [L173] EXPR var_77 & mask_SORT_5 VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, next_74_arg_1=0, state_22=0, state_24=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0] [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] EXPR input_7 & mask_SORT_5 [L88] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] EXPR input_8 & mask_SORT_5 [L90] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] EXPR input_9 & mask_SORT_5 [L92] EXPR input_9 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] EXPR var_20 & mask_SORT_5 [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_53=0] [L114] EXPR var_53 & mask_SORT_1 [L114] EXPR var_53 & mask_SORT_1 VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0] [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; VAL [bad_21_arg_0=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_59=0] [L133] EXPR var_59 & mask_SORT_1 [L133] EXPR var_59 & mask_SORT_1 VAL [bad_21_arg_0=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0] [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, state_22=0, state_24=0, state_29=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_73=0] [L169] EXPR var_73 & mask_SORT_5 [L169] EXPR var_73 & mask_SORT_5 VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, state_22=0, state_24=0, state_29=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0] [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, next_74_arg_1=0, state_22=0, state_24=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_77=-1] [L173] EXPR var_77 & mask_SORT_5 VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, next_74_arg_1=0, state_22=0, state_24=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_77=-1] [L173] EXPR var_77 & mask_SORT_5 [L173] EXPR var_77 & mask_SORT_5 VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, next_74_arg_1=0, state_22=0, state_24=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0] [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] EXPR input_7 & mask_SORT_5 [L88] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] EXPR input_8 & mask_SORT_5 [L90] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] EXPR input_9 & mask_SORT_5 [L92] EXPR input_9 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] EXPR var_20 & mask_SORT_5 [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_53=0] [L114] EXPR var_53 & mask_SORT_1 [L114] EXPR var_53 & mask_SORT_1 VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0] [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; VAL [bad_21_arg_0=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_59=0] [L133] EXPR var_59 & mask_SORT_1 [L133] EXPR var_59 & mask_SORT_1 VAL [bad_21_arg_0=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0] [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, state_22=0, state_24=0, state_29=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_73=0] [L169] EXPR var_73 & mask_SORT_5 [L169] EXPR var_73 & mask_SORT_5 VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, state_22=0, state_24=0, state_29=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0] [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, next_74_arg_1=0, state_22=0, state_24=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_77=-1] [L173] EXPR var_77 & mask_SORT_5 VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, next_74_arg_1=0, state_22=0, state_24=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0, var_77=-1] [L173] EXPR var_77 & mask_SORT_5 [L173] EXPR var_77 & mask_SORT_5 VAL [bad_21_arg_0=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, next_74_arg_1=0, state_22=0, state_24=0, state_40=0, var_10=0, var_18=1, var_28=0, var_52=0, var_58=0] [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] EXPR input_7 & mask_SORT_5 [L88] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] EXPR input_8 & mask_SORT_5 [L90] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] EXPR input_9 & mask_SORT_5 [L92] EXPR input_9 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20=1, var_28=0] [L103] EXPR var_20 & mask_SORT_5 [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; VAL [bad_21_arg_0=1, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L105] CALL __VERIFIER_assert(!(bad_21_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, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1683 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1679 mSDsluCounter, 3654 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3056 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1879 IncrementalHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 598 mSDtfsCounter, 1879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 912 GetRequests, 787 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=755occurred in iteration=6, InterpolantAutomatonStates: 97, 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, 6 MinimizatonAttempts, 651 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1247 NumberOfCodeBlocks, 1247 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1483 ConstructedInterpolants, 0 QuantifiedInterpolants, 9796 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2632 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 1170/1455 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:09,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.eq_sdp_v3.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:11,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:25:11,801 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:11,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:25:11,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:25:11,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:25:11,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:25:11,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:25:11,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:25:11,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:25:11,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:25:11,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:25:11,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:25:11,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:25:11,837 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:25:11,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:25:11,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:25:11,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:25:11,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:25:11,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:25:11,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:25:11,842 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:25:11,842 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:25:11,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:25:11,843 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:25:11,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:25:11,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:25:11,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:25:11,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:25:11,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:25:11,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:25:11,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:25:11,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:25:11,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:25:11,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:25:11,846 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:25:11,846 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:25:11,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:25:11,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:25:11,847 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:25:11,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:25:11,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:25:11,847 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:25:11,848 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:12,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:25:12,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:25:12,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:25:12,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:25:12,162 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:25:12,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-08-14 14:25:13,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:25:13,682 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:25:13,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-08-14 14:25:13,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1153cc2e2/625829c7305a4fca8f94b1c9167f2528/FLAGb0a245868 [2024-08-14 14:25:13,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1153cc2e2/625829c7305a4fca8f94b1c9167f2528 [2024-08-14 14:25:13,715 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:25:13,716 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:25:13,716 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.eq_sdp_v3.yml/witness.yml [2024-08-14 14:25:13,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:25:13,765 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:25:13,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:25:13,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:25:13,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:25:13,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:25:13" (1/2) ... [2024-08-14 14:25:13,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8af011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:13, skipping insertion in model container [2024-08-14 14:25:13,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:25:13" (1/2) ... [2024-08-14 14:25:13,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@676b6ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:13, skipping insertion in model container [2024-08-14 14:25:13,775 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:13" (2/2) ... [2024-08-14 14:25:13,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8af011 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:13, skipping insertion in model container [2024-08-14 14:25:13,775 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:13" (2/2) ... [2024-08-14 14:25:13,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:25:13,929 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.eq_sdp_v3.c[1249,1262] [2024-08-14 14:25:14,002 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:25:14,016 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:25:14,029 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.eq_sdp_v3.c[1249,1262] [2024-08-14 14:25:14,058 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:25:14,076 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:25:14,077 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:14 WrapperNode [2024-08-14 14:25:14,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:25:14,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:25:14,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:25:14,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:25:14,089 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:14" (1/1) ... [2024-08-14 14:25:14,090 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:14" (1/1) ... [2024-08-14 14:25:14,103 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:14" (1/1) ... [2024-08-14 14:25:14,121 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:25:14,125 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:14" (1/1) ... [2024-08-14 14:25:14,125 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:14" (1/1) ... [2024-08-14 14:25:14,136 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:14" (1/1) ... [2024-08-14 14:25:14,139 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:14" (1/1) ... [2024-08-14 14:25:14,144 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:14" (1/1) ... [2024-08-14 14:25:14,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:25:14,151 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:25:14,151 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:25:14,151 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:25:14,152 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:14" (1/1) ... [2024-08-14 14:25:14,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:25:14,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:14,190 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:14,194 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:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:25:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:25:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:25:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:25:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:25:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:25:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:25:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:25:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:25:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:25:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:25:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:25:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:25:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:25:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:25:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:25:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:25:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:25:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:25:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:25:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:25:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:25:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:25:14,333 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:25:14,335 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:25:14,625 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-08-14 14:25:14,625 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:25:14,637 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:25:14,637 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:25:14,637 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:25:14 BoogieIcfgContainer [2024-08-14 14:25:14,638 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:25:14,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:25:14,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:25:14,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:25:14,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:25:13" (1/4) ... [2024-08-14 14:25:14,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136bb989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:25:14, skipping insertion in model container [2024-08-14 14:25:14,644 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:13" (2/4) ... [2024-08-14 14:25:14,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136bb989 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:25:14, skipping insertion in model container [2024-08-14 14:25:14,644 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:14" (3/4) ... [2024-08-14 14:25:14,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136bb989 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:25:14, skipping insertion in model container [2024-08-14 14:25:14,645 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:14" (4/4) ... [2024-08-14 14:25:14,646 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v3.c [2024-08-14 14:25:14,646 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:14,664 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:25:14,675 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:25:14,705 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [12] [2024-08-14 14:25:14,709 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:25:14,752 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 116 states to 68 states. [2024-08-14 14:25:14,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:25:14,782 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;@5884f211, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:25:14,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:25:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2024-08-14 14:25:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-08-14 14:25:14,792 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:14,792 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:14,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:14,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1971824479, now seen corresponding path program 1 times [2024-08-14 14:25:14,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:25:14,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310593089] [2024-08-14 14:25:14,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:14,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:25:14,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:25:14,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-14 14:25:14,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-08-14 14:25:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:25:15,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:25:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:25:15,221 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:25:15,223 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:25:15,224 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:25:15,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-08-14 14:25:15,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:25:15,430 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:25:15,433 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:25:15,479 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:25:15 BoogieIcfgContainer [2024-08-14 14:25:15,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:25:15,480 INFO L158 Benchmark]: Toolchain (without parser) took 1715.31ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 54.9MB in the beginning and 33.3MB in the end (delta: 21.6MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2024-08-14 14:25:15,480 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 50.3MB. Free memory is still 23.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:25:15,481 INFO L158 Benchmark]: Witness Parser took 0.08ms. Allocated memory is still 77.6MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:25:15,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.49ms. Allocated memory is still 77.6MB. Free memory was 54.7MB in the beginning and 38.2MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-08-14 14:25:15,482 INFO L158 Benchmark]: Boogie Preprocessor took 69.34ms. Allocated memory is still 77.6MB. Free memory was 38.2MB in the beginning and 34.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:25:15,483 INFO L158 Benchmark]: IcfgBuilder took 486.96ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 34.8MB in the beginning and 46.6MB in the end (delta: -11.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-08-14 14:25:15,484 INFO L158 Benchmark]: TraceAbstraction took 839.17ms. Allocated memory is still 94.4MB. Free memory was 46.1MB in the beginning and 33.3MB in the end (delta: 12.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-08-14 14:25:15,486 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 50.3MB. Free memory is still 23.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.08ms. Allocated memory is still 77.6MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.49ms. Allocated memory is still 77.6MB. Free memory was 54.7MB in the beginning and 38.2MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.34ms. Allocated memory is still 77.6MB. Free memory was 38.2MB in the beginning and 34.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 486.96ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 34.8MB in the beginning and 46.6MB in the end (delta: -11.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 839.17ms. Allocated memory is still 94.4MB. Free memory was 46.1MB in the beginning and 33.3MB in the end (delta: 12.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=-1, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=-1, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=-1, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=-1, mask_SORT_5=1, state_22=-64, state_24=64, state_26=-128, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=-1, mask_SORT_5=1, state_22=-64, state_24=64, state_26=-128, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=-1, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=-128, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) VAL [bad_21_arg_0=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=-1, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=-128, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; VAL [bad_21_arg_0=1, input_7=0, input_8=0, input_9=0, mask_SORT_1=-1, mask_SORT_5=1, state_22=0, state_24=-1, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=1, state_42=0, var_10=0, var_18=1, var_28=0] [L105] CALL __VERIFIER_assert(!(bad_21_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.7s, OverallIterations: 1, TraceHistogramMax: 4, 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=68occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-14 14:25:15,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE