./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_rotate32.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.vis_QF_BV_rotate32.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_rotate32.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:28:01,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:28:01,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-14 14:28:01,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:28:01,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:28:01,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:28:01,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:28:01,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:28:01,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:28:01,645 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:28:01,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:28:01,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:28:01,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:28:01,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:28:01,647 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:28:01,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:28:01,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:28:01,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:28:01,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:28:01,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:28:01,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:28:01,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:28:01,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:28:01,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:28:01,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:28:01,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:28:01,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:28:01,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:28:01,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:28:01,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:28:01,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:28:01,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:28:01,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:28:01,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:28:01,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:28:01,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:28:01,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:28:01,657 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:28:01,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:28:01,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:28:01,658 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:28:01,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:28:02,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:28:02,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:28:02,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:28:02,009 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:28:02,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2024-08-14 14:28:03,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:28:03,665 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:28:03,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2024-08-14 14:28:03,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96efc95f5/4580da21ace04b9da73a47ae87c30d59/FLAG770a99a35 [2024-08-14 14:28:03,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96efc95f5/4580da21ace04b9da73a47ae87c30d59 [2024-08-14 14:28:03,704 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:28:03,706 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:28:03,707 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.vis_QF_BV_rotate32.yml/witness.yml [2024-08-14 14:28:03,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:28:03,776 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:28:03,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:28:03,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:28:03,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:28:03,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:28:03" (1/2) ... [2024-08-14 14:28:03,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278ec205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:28:03, skipping insertion in model container [2024-08-14 14:28:03,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:28:03" (1/2) ... [2024-08-14 14:28:03,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@49719220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:28:03, skipping insertion in model container [2024-08-14 14:28:03,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:28:03" (2/2) ... [2024-08-14 14:28:03,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278ec205 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:03, skipping insertion in model container [2024-08-14 14:28:03,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:28:03" (2/2) ... [2024-08-14 14:28:03,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:28:04,033 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.vis_QF_BV_rotate32.c[1258,1271] [2024-08-14 14:28:04,129 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:28:04,140 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:28:04,152 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.vis_QF_BV_rotate32.c[1258,1271] [2024-08-14 14:28:04,192 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:28:04,215 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:28:04,215 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04 WrapperNode [2024-08-14 14:28:04,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:28:04,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:28:04,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:28:04,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:28:04,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04" (1/1) ... [2024-08-14 14:28:04,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04" (1/1) ... [2024-08-14 14:28:04,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04" (1/1) ... [2024-08-14 14:28:04,278 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:28:04,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04" (1/1) ... [2024-08-14 14:28:04,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04" (1/1) ... [2024-08-14 14:28:04,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04" (1/1) ... [2024-08-14 14:28:04,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04" (1/1) ... [2024-08-14 14:28:04,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04" (1/1) ... [2024-08-14 14:28:04,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:28:04,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:28:04,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:28:04,296 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:28:04,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04" (1/1) ... [2024-08-14 14:28:04,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:28:04,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:04,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:28:04,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:28:04,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:28:04,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:28:04,401 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:28:04,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:28:04,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:28:04,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:28:04,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:28:04,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:28:04,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:28:04,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:28:04,402 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:28:04,402 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:28:04,402 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:28:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:28:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:28:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:28:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:28:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:28:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:28:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:28:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:28:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:28:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:28:04,550 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:28:04,554 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:28:05,055 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-08-14 14:28:05,056 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:28:05,069 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:28:05,070 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:28:05,071 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:28:05 BoogieIcfgContainer [2024-08-14 14:28:05,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:28:05,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:28:05,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:28:05,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:28:05,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:28:03" (1/4) ... [2024-08-14 14:28:05,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dda641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:28:05, skipping insertion in model container [2024-08-14 14:28:05,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:28:03" (2/4) ... [2024-08-14 14:28:05,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dda641 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:28:05, skipping insertion in model container [2024-08-14 14:28:05,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:28:04" (3/4) ... [2024-08-14 14:28:05,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dda641 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:28:05, skipping insertion in model container [2024-08-14 14:28:05,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:28:05" (4/4) ... [2024-08-14 14:28:05,080 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_rotate32.c [2024-08-14 14:28:05,080 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:28:05,096 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:28:05,097 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:28:05,121 INFO L92 WitnessUtils]: Constructing product of automaton with 81 states and violation witness of the following lengths: [9] [2024-08-14 14:28:05,126 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 81 states, 73 states have (on average 1.5890410958904109) internal successors, (116), 74 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:28:05,266 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 427 states to 390 states. [2024-08-14 14:28:05,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:28:05,294 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;@4553e119, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:28:05,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:28:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states. [2024-08-14 14:28:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-08-14 14:28:05,309 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:05,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:05,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:05,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:05,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1641050639, now seen corresponding path program 1 times [2024-08-14 14:28:05,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79497247] [2024-08-14 14:28:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-08-14 14:28:06,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:06,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79497247] [2024-08-14 14:28:06,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79497247] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:06,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:06,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:28:06,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054062318] [2024-08-14 14:28:06,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:06,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:28:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:06,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:28:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:28:06,588 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:28:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:06,673 INFO L93 Difference]: Finished difference Result 374 states and 588 transitions. [2024-08-14 14:28:06,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:28:06,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 105 [2024-08-14 14:28:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:06,685 INFO L225 Difference]: With dead ends: 374 [2024-08-14 14:28:06,685 INFO L226 Difference]: Without dead ends: 372 [2024-08-14 14:28:06,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:28:06,691 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 83 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 551 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:28:06,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 551 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:28:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-08-14 14:28:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 148. [2024-08-14 14:28:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 138 states have (on average 1.5869565217391304) internal successors, (219), 139 states have internal predecessors, (219), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions. [2024-08-14 14:28:06,753 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 105 [2024-08-14 14:28:06,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:06,753 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions. [2024-08-14 14:28:06,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:28:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions. [2024-08-14 14:28:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-08-14 14:28:06,759 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:06,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:06,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:28:06,762 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:06,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2019546501, now seen corresponding path program 1 times [2024-08-14 14:28:06,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:06,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522697739] [2024-08-14 14:28:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:07,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:07,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-08-14 14:28:07,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:07,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522697739] [2024-08-14 14:28:07,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522697739] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:07,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:07,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:28:07,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567327465] [2024-08-14 14:28:07,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:07,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:28:07,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:07,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:28:07,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:28:07,231 INFO L87 Difference]: Start difference. First operand 148 states and 228 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:28:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:07,266 INFO L93 Difference]: Finished difference Result 154 states and 234 transitions. [2024-08-14 14:28:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:28:07,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 106 [2024-08-14 14:28:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:07,271 INFO L225 Difference]: With dead ends: 154 [2024-08-14 14:28:07,271 INFO L226 Difference]: Without dead ends: 154 [2024-08-14 14:28:07,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:28:07,274 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 332 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:28:07,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:28:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-08-14 14:28:07,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2024-08-14 14:28:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 143 states have internal predecessors, (223), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2024-08-14 14:28:07,294 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 106 [2024-08-14 14:28:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:07,296 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2024-08-14 14:28:07,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:28:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2024-08-14 14:28:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-08-14 14:28:07,299 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:07,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:07,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:28:07,300 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:07,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1813840844, now seen corresponding path program 1 times [2024-08-14 14:28:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:07,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232238464] [2024-08-14 14:28:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-08-14 14:28:08,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:08,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232238464] [2024-08-14 14:28:08,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232238464] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:08,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128068021] [2024-08-14 14:28:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:08,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:08,358 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:28:08,359 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:28:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:08,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 52 conjunts are in the unsatisfiable core [2024-08-14 14:28:08,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-08-14 14:28:09,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:28:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-08-14 14:28:11,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128068021] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:28:11,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:28:11,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2024-08-14 14:28:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221614371] [2024-08-14 14:28:11,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:28:11,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-08-14 14:28:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-08-14 14:28:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-08-14 14:28:11,542 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand has 18 states, 18 states have (on average 9.0) internal successors, (162), 18 states have internal predecessors, (162), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:11,830 INFO L93 Difference]: Finished difference Result 158 states and 238 transitions. [2024-08-14 14:28:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:28:11,831 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.0) internal successors, (162), 18 states have internal predecessors, (162), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 107 [2024-08-14 14:28:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:11,834 INFO L225 Difference]: With dead ends: 158 [2024-08-14 14:28:11,834 INFO L226 Difference]: Without dead ends: 158 [2024-08-14 14:28:11,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-08-14 14:28:11,836 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 119 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:11,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 660 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:28:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-08-14 14:28:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-08-14 14:28:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 145 states have (on average 1.5586206896551724) internal successors, (226), 146 states have internal predecessors, (226), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 235 transitions. [2024-08-14 14:28:11,853 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 235 transitions. Word has length 107 [2024-08-14 14:28:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:11,854 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 235 transitions. [2024-08-14 14:28:11,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.0) internal successors, (162), 18 states have internal predecessors, (162), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 235 transitions. [2024-08-14 14:28:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-08-14 14:28:11,855 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:11,856 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:11,878 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:28:12,059 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:28:12,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:12,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1332272066, now seen corresponding path program 1 times [2024-08-14 14:28:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155526666] [2024-08-14 14:28:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-08-14 14:28:12,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:12,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155526666] [2024-08-14 14:28:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155526666] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:12,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345559388] [2024-08-14 14:28:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:12,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:12,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:12,968 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:28:12,970 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:28:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 25 conjunts are in the unsatisfiable core [2024-08-14 14:28:13,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:28:13,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:28:13,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345559388] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:13,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:28:13,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2024-08-14 14:28:13,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124313310] [2024-08-14 14:28:13,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:13,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-14 14:28:13,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:13,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-14 14:28:13,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:28:13,520 INFO L87 Difference]: Start difference. First operand 155 states and 235 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:28:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:13,628 INFO L93 Difference]: Finished difference Result 247 states and 385 transitions. [2024-08-14 14:28:13,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 14:28:13,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2024-08-14 14:28:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:13,631 INFO L225 Difference]: With dead ends: 247 [2024-08-14 14:28:13,631 INFO L226 Difference]: Without dead ends: 247 [2024-08-14 14:28:13,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:28:13,632 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 107 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:13,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 572 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:28:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-08-14 14:28:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2024-08-14 14:28:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 233 states have (on average 1.5879828326180256) internal successors, (370), 234 states have internal predecessors, (370), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 379 transitions. [2024-08-14 14:28:13,642 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 379 transitions. Word has length 108 [2024-08-14 14:28:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:13,643 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 379 transitions. [2024-08-14 14:28:13,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:28:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 379 transitions. [2024-08-14 14:28:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-08-14 14:28:13,644 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:13,644 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:13,665 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:28:13,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-08-14 14:28:13,849 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:13,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1038869059, now seen corresponding path program 1 times [2024-08-14 14:28:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:13,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562264367] [2024-08-14 14:28:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:13,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:15,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:15,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:15,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:28:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562264367] [2024-08-14 14:28:15,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562264367] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525164454] [2024-08-14 14:28:15,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:15,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:15,647 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:28:15,649 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:28:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:16,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 205 conjunts are in the unsatisfiable core [2024-08-14 14:28:16,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-08-14 14:28:19,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:28:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-14 14:28:28,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525164454] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:28:28,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:28:28,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 35, 33] total 76 [2024-08-14 14:28:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875036402] [2024-08-14 14:28:28,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:28:28,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-08-14 14:28:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:28,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-08-14 14:28:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=5099, Unknown=0, NotChecked=0, Total=5700 [2024-08-14 14:28:28,417 INFO L87 Difference]: Start difference. First operand 243 states and 379 transitions. Second operand has 76 states, 76 states have (on average 3.4078947368421053) internal successors, (259), 76 states have internal predecessors, (259), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:28:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:36,524 INFO L93 Difference]: Finished difference Result 471 states and 711 transitions. [2024-08-14 14:28:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-08-14 14:28:36,525 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.4078947368421053) internal successors, (259), 76 states have internal predecessors, (259), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 108 [2024-08-14 14:28:36,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:36,527 INFO L225 Difference]: With dead ends: 471 [2024-08-14 14:28:36,527 INFO L226 Difference]: Without dead ends: 471 [2024-08-14 14:28:36,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3425 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2021, Invalid=15271, Unknown=0, NotChecked=0, Total=17292 [2024-08-14 14:28:36,534 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1759 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 4014 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 4095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 4014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:36,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 2090 Invalid, 4095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 4014 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-08-14 14:28:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-08-14 14:28:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 353. [2024-08-14 14:28:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 343 states have (on average 1.5626822157434401) internal successors, (536), 344 states have internal predecessors, (536), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 545 transitions. [2024-08-14 14:28:36,545 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 545 transitions. Word has length 108 [2024-08-14 14:28:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:36,546 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 545 transitions. [2024-08-14 14:28:36,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.4078947368421053) internal successors, (259), 76 states have internal predecessors, (259), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:28:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 545 transitions. [2024-08-14 14:28:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-08-14 14:28:36,547 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:36,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:36,567 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:28:36,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:36,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:36,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 522948122, now seen corresponding path program 1 times [2024-08-14 14:28:36,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:36,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615664801] [2024-08-14 14:28:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:37,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:37,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:28:37,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:37,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615664801] [2024-08-14 14:28:37,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615664801] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:37,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:37,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-14 14:28:37,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823370155] [2024-08-14 14:28:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:37,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-14 14:28:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-14 14:28:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-08-14 14:28:37,564 INFO L87 Difference]: Start difference. First operand 353 states and 545 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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:28:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:37,838 INFO L93 Difference]: Finished difference Result 455 states and 707 transitions. [2024-08-14 14:28:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 14:28:37,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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 109 [2024-08-14 14:28:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:37,841 INFO L225 Difference]: With dead ends: 455 [2024-08-14 14:28:37,841 INFO L226 Difference]: Without dead ends: 455 [2024-08-14 14:28:37,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-08-14 14:28:37,842 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 146 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:37,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 789 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:28:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-08-14 14:28:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 443. [2024-08-14 14:28:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 433 states have (on average 1.5704387990762125) internal successors, (680), 434 states have internal predecessors, (680), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 689 transitions. [2024-08-14 14:28:37,855 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 689 transitions. Word has length 109 [2024-08-14 14:28:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:37,855 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 689 transitions. [2024-08-14 14:28:37,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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:28:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 689 transitions. [2024-08-14 14:28:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-08-14 14:28:37,857 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:37,858 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:37,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-14 14:28:37,858 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:37,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash -501745799, now seen corresponding path program 1 times [2024-08-14 14:28:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:37,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482667029] [2024-08-14 14:28:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:37,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:39,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:39,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:39,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-08-14 14:28:39,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:39,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482667029] [2024-08-14 14:28:39,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482667029] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:39,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983979006] [2024-08-14 14:28:39,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:39,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:39,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:39,751 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:28:39,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-14 14:28:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:40,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-14 14:28:40,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-14 14:28:40,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:28:40,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983979006] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:40,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:28:40,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2024-08-14 14:28:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524601593] [2024-08-14 14:28:40,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:40,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:28:40,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:40,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:28:40,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-08-14 14:28:40,391 INFO L87 Difference]: Start difference. First operand 443 states and 689 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:28:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:40,593 INFO L93 Difference]: Finished difference Result 443 states and 685 transitions. [2024-08-14 14:28:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:28:40,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2024-08-14 14:28:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:40,596 INFO L225 Difference]: With dead ends: 443 [2024-08-14 14:28:40,596 INFO L226 Difference]: Without dead ends: 443 [2024-08-14 14:28:40,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-08-14 14:28:40,597 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:40,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 397 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:28:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-08-14 14:28:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-08-14 14:28:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 433 states have (on average 1.5612009237875288) internal successors, (676), 434 states have internal predecessors, (676), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 685 transitions. [2024-08-14 14:28:40,609 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 685 transitions. Word has length 109 [2024-08-14 14:28:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:40,609 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 685 transitions. [2024-08-14 14:28:40,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:28:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 685 transitions. [2024-08-14 14:28:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-08-14 14:28:40,611 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:40,611 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:40,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-14 14:28:40,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:40,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:40,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash 938462841, now seen corresponding path program 1 times [2024-08-14 14:28:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:40,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742414158] [2024-08-14 14:28:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:40,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:43,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:28:43,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:43,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742414158] [2024-08-14 14:28:43,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742414158] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:43,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153982997] [2024-08-14 14:28:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:43,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:43,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:43,710 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:28:43,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-14 14:28:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:43,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-14 14:28:43,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-14 14:28:44,147 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:28:44,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153982997] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:44,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:28:44,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-08-14 14:28:44,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194149359] [2024-08-14 14:28:44,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:44,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:28:44,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:44,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:28:44,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2024-08-14 14:28:44,149 INFO L87 Difference]: Start difference. First operand 443 states and 685 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:28:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:44,277 INFO L93 Difference]: Finished difference Result 443 states and 681 transitions. [2024-08-14 14:28:44,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:28:44,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-08-14 14:28:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:44,280 INFO L225 Difference]: With dead ends: 443 [2024-08-14 14:28:44,280 INFO L226 Difference]: Without dead ends: 443 [2024-08-14 14:28:44,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2024-08-14 14:28:44,283 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:44,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 340 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:28:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-08-14 14:28:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-08-14 14:28:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 433 states have (on average 1.5519630484988454) internal successors, (672), 434 states have internal predecessors, (672), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 681 transitions. [2024-08-14 14:28:44,293 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 681 transitions. Word has length 110 [2024-08-14 14:28:44,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:44,293 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 681 transitions. [2024-08-14 14:28:44,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:28:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 681 transitions. [2024-08-14 14:28:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-08-14 14:28:44,295 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:44,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:44,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-08-14 14:28:44,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:44,496 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:44,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash -734159881, now seen corresponding path program 1 times [2024-08-14 14:28:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:44,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308857269] [2024-08-14 14:28:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:45,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:45,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-08-14 14:28:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308857269] [2024-08-14 14:28:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308857269] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717826754] [2024-08-14 14:28:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:45,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:45,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:45,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:28:45,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-14 14:28:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:46,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 35 conjunts are in the unsatisfiable core [2024-08-14 14:28:46,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-08-14 14:28:46,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:28:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-14 14:28:46,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717826754] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:28:46,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:28:46,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 25 [2024-08-14 14:28:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546575393] [2024-08-14 14:28:46,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:28:46,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-08-14 14:28:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:46,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-08-14 14:28:46,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2024-08-14 14:28:46,863 INFO L87 Difference]: Start difference. First operand 443 states and 681 transitions. Second operand has 25 states, 25 states have (on average 8.16) internal successors, (204), 25 states have internal predecessors, (204), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:47,629 INFO L93 Difference]: Finished difference Result 494 states and 740 transitions. [2024-08-14 14:28:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-14 14:28:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.16) internal successors, (204), 25 states have internal predecessors, (204), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 110 [2024-08-14 14:28:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:47,631 INFO L225 Difference]: With dead ends: 494 [2024-08-14 14:28:47,631 INFO L226 Difference]: Without dead ends: 482 [2024-08-14 14:28:47,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=1264, Unknown=0, NotChecked=0, Total=1482 [2024-08-14 14:28:47,632 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 313 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:47,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 960 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-14 14:28:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-08-14 14:28:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 465. [2024-08-14 14:28:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 455 states have (on average 1.5362637362637364) internal successors, (699), 456 states have internal predecessors, (699), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 708 transitions. [2024-08-14 14:28:47,646 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 708 transitions. Word has length 110 [2024-08-14 14:28:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:47,646 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 708 transitions. [2024-08-14 14:28:47,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.16) internal successors, (204), 25 states have internal predecessors, (204), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 708 transitions. [2024-08-14 14:28:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-14 14:28:47,648 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:47,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:47,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-08-14 14:28:47,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:47,849 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:47,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:47,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1034280979, now seen corresponding path program 1 times [2024-08-14 14:28:47,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:47,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397185697] [2024-08-14 14:28:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:47,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:49,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-08-14 14:28:49,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397185697] [2024-08-14 14:28:49,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397185697] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533764168] [2024-08-14 14:28:49,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:49,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:49,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:49,160 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:28:49,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-14 14:28:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:49,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-14 14:28:49,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:28:49,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:28:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-14 14:28:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533764168] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-14 14:28:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 8] total 21 [2024-08-14 14:28:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053368233] [2024-08-14 14:28:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:49,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:28:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:49,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:28:49,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-08-14 14:28:49,789 INFO L87 Difference]: Start difference. First operand 465 states and 708 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:28:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:49,860 INFO L93 Difference]: Finished difference Result 517 states and 780 transitions. [2024-08-14 14:28:49,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:28:49,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 111 [2024-08-14 14:28:49,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:49,862 INFO L225 Difference]: With dead ends: 517 [2024-08-14 14:28:49,862 INFO L226 Difference]: Without dead ends: 517 [2024-08-14 14:28:49,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-08-14 14:28:49,863 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 18 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:49,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 277 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:28:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-08-14 14:28:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 485. [2024-08-14 14:28:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 475 states have (on average 1.5305263157894737) internal successors, (727), 476 states have internal predecessors, (727), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 736 transitions. [2024-08-14 14:28:49,879 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 736 transitions. Word has length 111 [2024-08-14 14:28:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:49,880 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 736 transitions. [2024-08-14 14:28:49,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:28:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 736 transitions. [2024-08-14 14:28:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-14 14:28:49,882 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:49,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:49,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-08-14 14:28:50,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:50,083 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:50,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2058974900, now seen corresponding path program 1 times [2024-08-14 14:28:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057406882] [2024-08-14 14:28:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:50,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:50,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:28:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057406882] [2024-08-14 14:28:50,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057406882] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:50,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284494357] [2024-08-14 14:28:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:50,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:50,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:50,709 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:28:50,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-14 14:28:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:51,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-14 14:28:51,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:28:51,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:28:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-14 14:28:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284494357] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:51,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-14 14:28:51,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 7] total 18 [2024-08-14 14:28:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793756968] [2024-08-14 14:28:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:51,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:28:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:51,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:28:51,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-08-14 14:28:51,224 INFO L87 Difference]: Start difference. First operand 485 states and 736 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:28:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:51,328 INFO L93 Difference]: Finished difference Result 513 states and 770 transitions. [2024-08-14 14:28:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:28:51,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 111 [2024-08-14 14:28:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:51,330 INFO L225 Difference]: With dead ends: 513 [2024-08-14 14:28:51,330 INFO L226 Difference]: Without dead ends: 513 [2024-08-14 14:28:51,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-08-14 14:28:51,331 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 27 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:51,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 277 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:28:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-08-14 14:28:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 493. [2024-08-14 14:28:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 483 states have (on average 1.5175983436853002) internal successors, (733), 484 states have internal predecessors, (733), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 742 transitions. [2024-08-14 14:28:51,342 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 742 transitions. Word has length 111 [2024-08-14 14:28:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:51,342 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 742 transitions. [2024-08-14 14:28:51,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:28:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 742 transitions. [2024-08-14 14:28:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-14 14:28:51,344 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:51,344 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:51,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-08-14 14:28:51,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-08-14 14:28:51,545 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:51,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1717888760, now seen corresponding path program 1 times [2024-08-14 14:28:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:51,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284676291] [2024-08-14 14:28:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:53,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:53,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:53,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:28:53,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:53,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284676291] [2024-08-14 14:28:53,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284676291] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:53,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:53,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-08-14 14:28:53,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44759657] [2024-08-14 14:28:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:53,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-14 14:28:53,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:53,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-14 14:28:53,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-08-14 14:28:53,101 INFO L87 Difference]: Start difference. First operand 493 states and 742 transitions. Second operand has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 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:28:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:53,322 INFO L93 Difference]: Finished difference Result 741 states and 1122 transitions. [2024-08-14 14:28:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 14:28:53,323 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 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 111 [2024-08-14 14:28:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:53,326 INFO L225 Difference]: With dead ends: 741 [2024-08-14 14:28:53,326 INFO L226 Difference]: Without dead ends: 741 [2024-08-14 14:28:53,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-08-14 14:28:53,327 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 300 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:53,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1415 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:28:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-08-14 14:28:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 541. [2024-08-14 14:28:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 531 states have (on average 1.5197740112994351) internal successors, (807), 532 states have internal predecessors, (807), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 816 transitions. [2024-08-14 14:28:53,344 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 816 transitions. Word has length 111 [2024-08-14 14:28:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:53,345 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 816 transitions. [2024-08-14 14:28:53,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 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:28:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 816 transitions. [2024-08-14 14:28:53,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-14 14:28:53,349 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:53,349 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:53,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-14 14:28:53,349 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:53,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1059740918, now seen corresponding path program 1 times [2024-08-14 14:28:53,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:53,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338917099] [2024-08-14 14:28:53,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:53,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:54,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:54,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-14 14:28:54,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:54,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338917099] [2024-08-14 14:28:54,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338917099] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:54,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697286932] [2024-08-14 14:28:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:54,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:54,527 INFO L229 MonitoredProcess]: Starting monitored process 10 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:28:54,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-08-14 14:28:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:54,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 25 conjunts are in the unsatisfiable core [2024-08-14 14:28:54,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:28:55,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:28:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:28:55,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697286932] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:28:55,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:28:55,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2024-08-14 14:28:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628554069] [2024-08-14 14:28:55,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:28:55,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-08-14 14:28:55,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:55,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-08-14 14:28:55,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2024-08-14 14:28:55,822 INFO L87 Difference]: Start difference. First operand 541 states and 816 transitions. Second operand has 26 states, 26 states have (on average 9.0) internal successors, (234), 26 states have internal predecessors, (234), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:56,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:56,560 INFO L93 Difference]: Finished difference Result 889 states and 1336 transitions. [2024-08-14 14:28:56,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-14 14:28:56,561 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.0) internal successors, (234), 26 states have internal predecessors, (234), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 111 [2024-08-14 14:28:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:56,564 INFO L225 Difference]: With dead ends: 889 [2024-08-14 14:28:56,564 INFO L226 Difference]: Without dead ends: 889 [2024-08-14 14:28:56,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=1807, Unknown=0, NotChecked=0, Total=2070 [2024-08-14 14:28:56,566 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 432 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:56,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1622 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:28:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-08-14 14:28:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 799. [2024-08-14 14:28:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 789 states have (on average 1.5183776932826363) internal successors, (1198), 790 states have internal predecessors, (1198), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1207 transitions. [2024-08-14 14:28:56,581 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1207 transitions. Word has length 111 [2024-08-14 14:28:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:56,582 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1207 transitions. [2024-08-14 14:28:56,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.0) internal successors, (234), 26 states have internal predecessors, (234), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:28:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1207 transitions. [2024-08-14 14:28:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-14 14:28:56,584 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:56,584 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:56,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-08-14 14:28:56,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-08-14 14:28:56,785 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:56,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash 509964314, now seen corresponding path program 1 times [2024-08-14 14:28:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:56,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220222286] [2024-08-14 14:28:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:56,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:28:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-08-14 14:28:57,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:57,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220222286] [2024-08-14 14:28:57,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220222286] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:57,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380945481] [2024-08-14 14:28:57,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:57,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:57,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:57,571 INFO L229 MonitoredProcess]: Starting monitored process 11 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:28:57,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-08-14 14:28:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:57,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 66 conjunts are in the unsatisfiable core [2024-08-14 14:28:57,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-14 14:28:58,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:28:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-14 14:28:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380945481] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:28:58,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:28:58,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 34 [2024-08-14 14:28:58,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842711418] [2024-08-14 14:28:58,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:28:58,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-08-14 14:28:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-08-14 14:28:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2024-08-14 14:28:58,856 INFO L87 Difference]: Start difference. First operand 799 states and 1207 transitions. Second operand has 34 states, 34 states have (on average 6.205882352941177) internal successors, (211), 34 states have internal predecessors, (211), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:00,769 INFO L93 Difference]: Finished difference Result 1584 states and 2372 transitions. [2024-08-14 14:29:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-08-14 14:29:00,770 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.205882352941177) internal successors, (211), 34 states have internal predecessors, (211), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 111 [2024-08-14 14:29:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:00,775 INFO L225 Difference]: With dead ends: 1584 [2024-08-14 14:29:00,775 INFO L226 Difference]: Without dead ends: 1584 [2024-08-14 14:29:00,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=835, Invalid=5807, Unknown=0, NotChecked=0, Total=6642 [2024-08-14 14:29:00,778 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 692 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:00,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1757 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-14 14:29:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-08-14 14:29:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1351. [2024-08-14 14:29:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1341 states have (on average 1.5078299776286352) internal successors, (2022), 1342 states have internal predecessors, (2022), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2031 transitions. [2024-08-14 14:29:00,805 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2031 transitions. Word has length 111 [2024-08-14 14:29:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:00,806 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 2031 transitions. [2024-08-14 14:29:00,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.205882352941177) internal successors, (211), 34 states have internal predecessors, (211), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2031 transitions. [2024-08-14 14:29:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-14 14:29:00,809 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:00,809 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:00,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-08-14 14:29:01,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-08-14 14:29:01,010 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:01,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1762132675, now seen corresponding path program 1 times [2024-08-14 14:29:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855580118] [2024-08-14 14:29:01,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-14 14:29:01,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:01,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855580118] [2024-08-14 14:29:01,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855580118] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:29:01,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:29:01,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-14 14:29:01,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814601962] [2024-08-14 14:29:01,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:01,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-14 14:29:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:01,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-14 14:29:01,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:29:01,770 INFO L87 Difference]: Start difference. First operand 1351 states and 2031 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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:29:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:01,878 INFO L93 Difference]: Finished difference Result 1459 states and 2181 transitions. [2024-08-14 14:29:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 14:29:01,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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 111 [2024-08-14 14:29:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:01,883 INFO L225 Difference]: With dead ends: 1459 [2024-08-14 14:29:01,883 INFO L226 Difference]: Without dead ends: 1459 [2024-08-14 14:29:01,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-08-14 14:29:01,884 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 21 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 860 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:29:01,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 860 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:29:01,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-08-14 14:29:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1426. [2024-08-14 14:29:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1416 states have (on average 1.5042372881355932) internal successors, (2130), 1417 states have internal predecessors, (2130), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2139 transitions. [2024-08-14 14:29:01,911 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2139 transitions. Word has length 111 [2024-08-14 14:29:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:01,911 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 2139 transitions. [2024-08-14 14:29:01,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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:29:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2139 transitions. [2024-08-14 14:29:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-14 14:29:01,914 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:01,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:01,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-14 14:29:01,916 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:01,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 891014560, now seen corresponding path program 1 times [2024-08-14 14:29:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:01,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482845239] [2024-08-14 14:29:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:02,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:02,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:02,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:02,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482845239] [2024-08-14 14:29:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482845239] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:02,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057391739] [2024-08-14 14:29:02,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:02,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:02,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:02,929 INFO L229 MonitoredProcess]: Starting monitored process 12 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:29:02,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-08-14 14:29:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:03,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 59 conjunts are in the unsatisfiable core [2024-08-14 14:29:03,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-14 14:29:03,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-08-14 14:29:05,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057391739] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:29:05,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:29:05,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 13] total 34 [2024-08-14 14:29:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293537608] [2024-08-14 14:29:05,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:29:05,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-08-14 14:29:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:05,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-08-14 14:29:05,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2024-08-14 14:29:05,917 INFO L87 Difference]: Start difference. First operand 1426 states and 2139 transitions. Second operand has 34 states, 34 states have (on average 6.382352941176471) internal successors, (217), 34 states have internal predecessors, (217), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:29:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:07,616 INFO L93 Difference]: Finished difference Result 1750 states and 2458 transitions. [2024-08-14 14:29:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-08-14 14:29:07,617 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.382352941176471) internal successors, (217), 34 states have internal predecessors, (217), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 111 [2024-08-14 14:29:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:07,622 INFO L225 Difference]: With dead ends: 1750 [2024-08-14 14:29:07,622 INFO L226 Difference]: Without dead ends: 1750 [2024-08-14 14:29:07,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1015, Invalid=5957, Unknown=0, NotChecked=0, Total=6972 [2024-08-14 14:29:07,625 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 931 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:07,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1356 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-14 14:29:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2024-08-14 14:29:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1614. [2024-08-14 14:29:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1604 states have (on average 1.4183291770573565) internal successors, (2275), 1605 states have internal predecessors, (2275), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2284 transitions. [2024-08-14 14:29:07,656 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2284 transitions. Word has length 111 [2024-08-14 14:29:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:07,656 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 2284 transitions. [2024-08-14 14:29:07,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.382352941176471) internal successors, (217), 34 states have internal predecessors, (217), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:29:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2284 transitions. [2024-08-14 14:29:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:07,660 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:07,660 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:07,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-08-14 14:29:07,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-08-14 14:29:07,861 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:07,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:07,861 INFO L85 PathProgramCache]: Analyzing trace with hash -348493096, now seen corresponding path program 1 times [2024-08-14 14:29:07,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:07,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260771115] [2024-08-14 14:29:07,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:07,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:08,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:08,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260771115] [2024-08-14 14:29:08,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260771115] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:29:08,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:29:08,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-08-14 14:29:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034318553] [2024-08-14 14:29:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:08,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-14 14:29:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-14 14:29:08,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-08-14 14:29:08,681 INFO L87 Difference]: Start difference. First operand 1614 states and 2284 transitions. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 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:29:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:09,030 INFO L93 Difference]: Finished difference Result 1879 states and 2634 transitions. [2024-08-14 14:29:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 14:29:09,031 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 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 112 [2024-08-14 14:29:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:09,035 INFO L225 Difference]: With dead ends: 1879 [2024-08-14 14:29:09,035 INFO L226 Difference]: Without dead ends: 1826 [2024-08-14 14:29:09,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-08-14 14:29:09,036 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 161 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:09,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1162 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:29:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-08-14 14:29:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1720. [2024-08-14 14:29:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1710 states have (on average 1.4140350877192982) internal successors, (2418), 1711 states have internal predecessors, (2418), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2427 transitions. [2024-08-14 14:29:09,065 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2427 transitions. Word has length 112 [2024-08-14 14:29:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:09,065 INFO L495 AbstractCegarLoop]: Abstraction has 1720 states and 2427 transitions. [2024-08-14 14:29:09,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 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:29:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2427 transitions. [2024-08-14 14:29:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:09,069 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:09,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:09,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-08-14 14:29:09,070 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:09,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash -309391595, now seen corresponding path program 1 times [2024-08-14 14:29:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:09,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718190381] [2024-08-14 14:29:09,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:09,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:10,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:10,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718190381] [2024-08-14 14:29:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718190381] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:10,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490767915] [2024-08-14 14:29:10,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:10,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:10,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:10,216 INFO L229 MonitoredProcess]: Starting monitored process 13 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:29:10,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-08-14 14:29:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:10,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 109 conjunts are in the unsatisfiable core [2024-08-14 14:29:10,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:29:11,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:29:17,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490767915] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:29:17,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:29:17,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25, 31] total 68 [2024-08-14 14:29:17,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171963085] [2024-08-14 14:29:17,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:29:17,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-08-14 14:29:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:17,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-08-14 14:29:17,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=4164, Unknown=0, NotChecked=0, Total=4556 [2024-08-14 14:29:17,733 INFO L87 Difference]: Start difference. First operand 1720 states and 2427 transitions. Second operand has 68 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 68 states have internal predecessors, (257), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:21,852 INFO L93 Difference]: Finished difference Result 2003 states and 2803 transitions. [2024-08-14 14:29:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-08-14 14:29:21,853 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 68 states have internal predecessors, (257), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 112 [2024-08-14 14:29:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:21,857 INFO L225 Difference]: With dead ends: 2003 [2024-08-14 14:29:21,857 INFO L226 Difference]: Without dead ends: 2002 [2024-08-14 14:29:21,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2275 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=816, Invalid=8690, Unknown=0, NotChecked=0, Total=9506 [2024-08-14 14:29:21,859 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 867 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 2722 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:21,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 2657 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2722 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-08-14 14:29:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2024-08-14 14:29:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1793. [2024-08-14 14:29:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1783 states have (on average 1.4127874369040943) internal successors, (2519), 1784 states have internal predecessors, (2519), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2528 transitions. [2024-08-14 14:29:21,888 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2528 transitions. Word has length 112 [2024-08-14 14:29:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:21,888 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2528 transitions. [2024-08-14 14:29:21,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 68 states have internal predecessors, (257), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2528 transitions. [2024-08-14 14:29:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:21,892 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:21,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:21,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-08-14 14:29:22,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-08-14 14:29:22,094 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:22,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash 935372886, now seen corresponding path program 1 times [2024-08-14 14:29:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:22,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628052744] [2024-08-14 14:29:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:22,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:23,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:23,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-14 14:29:23,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:23,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628052744] [2024-08-14 14:29:23,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628052744] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:29:23,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:29:23,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 14:29:23,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763812696] [2024-08-14 14:29:23,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:23,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:29:23,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:23,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:29:23,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:29:23,643 INFO L87 Difference]: Start difference. First operand 1793 states and 2528 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:29:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:24,256 INFO L93 Difference]: Finished difference Result 1599 states and 2250 transitions. [2024-08-14 14:29:24,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:29:24,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2024-08-14 14:29:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:24,260 INFO L225 Difference]: With dead ends: 1599 [2024-08-14 14:29:24,260 INFO L226 Difference]: Without dead ends: 1587 [2024-08-14 14:29:24,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:29:24,261 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 64 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:24,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 432 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-08-14 14:29:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-08-14 14:29:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1587. [2024-08-14 14:29:24,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1577 states have (on average 1.4121750158528852) internal successors, (2227), 1578 states have internal predecessors, (2227), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2236 transitions. [2024-08-14 14:29:24,286 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2236 transitions. Word has length 112 [2024-08-14 14:29:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:24,287 INFO L495 AbstractCegarLoop]: Abstraction has 1587 states and 2236 transitions. [2024-08-14 14:29:24,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:29:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2236 transitions. [2024-08-14 14:29:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:24,290 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:24,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:24,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-08-14 14:29:24,291 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:24,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash 7689821, now seen corresponding path program 1 times [2024-08-14 14:29:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:24,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390709646] [2024-08-14 14:29:24,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:24,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:24,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:24,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390709646] [2024-08-14 14:29:24,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390709646] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:29:24,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:29:24,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-14 14:29:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115144889] [2024-08-14 14:29:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:24,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 14:29:24,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:24,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 14:29:24,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-08-14 14:29:24,849 INFO L87 Difference]: Start difference. First operand 1587 states and 2236 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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:29:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:25,014 INFO L93 Difference]: Finished difference Result 2336 states and 3260 transitions. [2024-08-14 14:29:25,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 14:29:25,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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 112 [2024-08-14 14:29:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:25,022 INFO L225 Difference]: With dead ends: 2336 [2024-08-14 14:29:25,022 INFO L226 Difference]: Without dead ends: 2336 [2024-08-14 14:29:25,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-08-14 14:29:25,024 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 132 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:25,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 636 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:29:25,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2024-08-14 14:29:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2193. [2024-08-14 14:29:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 2183 states have (on average 1.3994502977553824) internal successors, (3055), 2184 states have internal predecessors, (3055), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3064 transitions. [2024-08-14 14:29:25,053 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3064 transitions. Word has length 112 [2024-08-14 14:29:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:25,053 INFO L495 AbstractCegarLoop]: Abstraction has 2193 states and 3064 transitions. [2024-08-14 14:29:25,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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:29:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3064 transitions. [2024-08-14 14:29:25,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:25,058 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:25,058 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:25,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-08-14 14:29:25,058 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:25,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash 46791322, now seen corresponding path program 1 times [2024-08-14 14:29:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:25,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814842559] [2024-08-14 14:29:25,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:26,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:26,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:26,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:29:26,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814842559] [2024-08-14 14:29:26,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814842559] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256313780] [2024-08-14 14:29:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:26,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:26,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:26,147 INFO L229 MonitoredProcess]: Starting monitored process 14 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:29:26,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-08-14 14:29:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:26,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 148 conjunts are in the unsatisfiable core [2024-08-14 14:29:26,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-14 14:29:27,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256313780] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:28,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-14 14:29:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19, 30] total 58 [2024-08-14 14:29:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354222906] [2024-08-14 14:29:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:28,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-14 14:29:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:28,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-14 14:29:28,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=3042, Unknown=0, NotChecked=0, Total=3306 [2024-08-14 14:29:28,653 INFO L87 Difference]: Start difference. First operand 2193 states and 3064 transitions. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:29:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:29,460 INFO L93 Difference]: Finished difference Result 3587 states and 5048 transitions. [2024-08-14 14:29:29,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 14:29:29,461 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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 112 [2024-08-14 14:29:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:29,467 INFO L225 Difference]: With dead ends: 3587 [2024-08-14 14:29:29,467 INFO L226 Difference]: Without dead ends: 2306 [2024-08-14 14:29:29,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=329, Invalid=4093, Unknown=0, NotChecked=0, Total=4422 [2024-08-14 14:29:29,468 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 687 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:29,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 725 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:29:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2024-08-14 14:29:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2167. [2024-08-14 14:29:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2157 states have (on average 1.3977746870653687) internal successors, (3015), 2158 states have internal predecessors, (3015), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3024 transitions. [2024-08-14 14:29:29,509 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3024 transitions. Word has length 112 [2024-08-14 14:29:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:29,509 INFO L495 AbstractCegarLoop]: Abstraction has 2167 states and 3024 transitions. [2024-08-14 14:29:29,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:29:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3024 transitions. [2024-08-14 14:29:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:29,513 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:29,514 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:29,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-08-14 14:29:29,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-08-14 14:29:29,714 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:29,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:29,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1291555803, now seen corresponding path program 1 times [2024-08-14 14:29:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:29,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424574296] [2024-08-14 14:29:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:30,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:30,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:30,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:30,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:30,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424574296] [2024-08-14 14:29:30,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424574296] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:29:30,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:29:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-14 14:29:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410446776] [2024-08-14 14:29:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:30,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-14 14:29:30,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:30,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-14 14:29:30,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-08-14 14:29:30,239 INFO L87 Difference]: Start difference. First operand 2167 states and 3024 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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:29:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:30,376 INFO L93 Difference]: Finished difference Result 2272 states and 3170 transitions. [2024-08-14 14:29:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 14:29:30,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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 112 [2024-08-14 14:29:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:30,384 INFO L225 Difference]: With dead ends: 2272 [2024-08-14 14:29:30,384 INFO L226 Difference]: Without dead ends: 2272 [2024-08-14 14:29:30,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-08-14 14:29:30,385 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 126 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:30,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 495 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:29:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2024-08-14 14:29:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2133. [2024-08-14 14:29:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2123 states have (on average 1.3984926990108337) internal successors, (2969), 2124 states have internal predecessors, (2969), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2978 transitions. [2024-08-14 14:29:30,414 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2978 transitions. Word has length 112 [2024-08-14 14:29:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:30,414 INFO L495 AbstractCegarLoop]: Abstraction has 2133 states and 2978 transitions. [2024-08-14 14:29:30,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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:29:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2978 transitions. [2024-08-14 14:29:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:30,419 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:30,419 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:30,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-08-14 14:29:30,419 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:30,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash 131763068, now seen corresponding path program 1 times [2024-08-14 14:29:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:30,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648597001] [2024-08-14 14:29:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:30,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:30,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:30,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:30,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648597001] [2024-08-14 14:29:30,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648597001] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:30,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659943315] [2024-08-14 14:29:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:30,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:30,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:30,876 INFO L229 MonitoredProcess]: Starting monitored process 15 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:29:30,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-08-14 14:29:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:31,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 46 conjunts are in the unsatisfiable core [2024-08-14 14:29:31,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:31,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659943315] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:32,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-14 14:29:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-08-14 14:29:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470966534] [2024-08-14 14:29:32,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-14 14:29:32,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-14 14:29:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-14 14:29:32,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-08-14 14:29:32,757 INFO L87 Difference]: Start difference. First operand 2133 states and 2978 transitions. Second operand has 15 states, 15 states have (on average 11.0) internal successors, (165), 15 states have internal predecessors, (165), 4 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:29:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:33,117 INFO L93 Difference]: Finished difference Result 2554 states and 3561 transitions. [2024-08-14 14:29:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:29:33,118 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.0) internal successors, (165), 15 states have internal predecessors, (165), 4 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 112 [2024-08-14 14:29:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:33,126 INFO L225 Difference]: With dead ends: 2554 [2024-08-14 14:29:33,126 INFO L226 Difference]: Without dead ends: 2554 [2024-08-14 14:29:33,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2024-08-14 14:29:33,127 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 185 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:33,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1070 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:29:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2024-08-14 14:29:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2517. [2024-08-14 14:29:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2507 states have (on average 1.4020741922616673) internal successors, (3515), 2508 states have internal predecessors, (3515), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3524 transitions. [2024-08-14 14:29:33,173 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3524 transitions. Word has length 112 [2024-08-14 14:29:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:33,173 INFO L495 AbstractCegarLoop]: Abstraction has 2517 states and 3524 transitions. [2024-08-14 14:29:33,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.0) internal successors, (165), 15 states have internal predecessors, (165), 4 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:29:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3524 transitions. [2024-08-14 14:29:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:33,180 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:33,180 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:33,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-08-14 14:29:33,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:33,381 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:33,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:33,382 INFO L85 PathProgramCache]: Analyzing trace with hash -865309285, now seen corresponding path program 1 times [2024-08-14 14:29:33,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:33,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528594169] [2024-08-14 14:29:33,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:33,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:34,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-08-14 14:29:34,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:34,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528594169] [2024-08-14 14:29:34,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528594169] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:34,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146979888] [2024-08-14 14:29:34,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:34,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:34,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:34,146 INFO L229 MonitoredProcess]: Starting monitored process 16 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:29:34,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-08-14 14:29:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:34,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-14 14:29:34,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:29:34,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-14 14:29:34,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146979888] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:34,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-14 14:29:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 7] total 18 [2024-08-14 14:29:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319701789] [2024-08-14 14:29:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:34,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:29:34,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:34,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:29:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-08-14 14:29:34,772 INFO L87 Difference]: Start difference. First operand 2517 states and 3524 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:29:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:34,852 INFO L93 Difference]: Finished difference Result 2358 states and 3304 transitions. [2024-08-14 14:29:34,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:29:34,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 112 [2024-08-14 14:29:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:34,859 INFO L225 Difference]: With dead ends: 2358 [2024-08-14 14:29:34,859 INFO L226 Difference]: Without dead ends: 2350 [2024-08-14 14:29:34,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-08-14 14:29:34,859 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 8 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:34,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 359 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:29:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2024-08-14 14:29:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2024-08-14 14:29:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2340 states have (on average 1.4047008547008546) internal successors, (3287), 2341 states have internal predecessors, (3287), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3296 transitions. [2024-08-14 14:29:34,888 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3296 transitions. Word has length 112 [2024-08-14 14:29:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:34,889 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 3296 transitions. [2024-08-14 14:29:34,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:29:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3296 transitions. [2024-08-14 14:29:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:34,893 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:34,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:34,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-08-14 14:29:35,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:35,094 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:35,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:35,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1486218641, now seen corresponding path program 1 times [2024-08-14 14:29:35,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:35,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179560278] [2024-08-14 14:29:35,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:35,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:36,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:36,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:36,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-14 14:29:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:36,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179560278] [2024-08-14 14:29:36,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179560278] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:36,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91404547] [2024-08-14 14:29:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:36,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:36,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:36,116 INFO L229 MonitoredProcess]: Starting monitored process 17 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:29:36,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-08-14 14:29:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:36,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 68 conjunts are in the unsatisfiable core [2024-08-14 14:29:36,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-08-14 14:29:36,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91404547] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:40,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-14 14:29:40,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2024-08-14 14:29:40,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229603982] [2024-08-14 14:29:40,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-14 14:29:40,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-08-14 14:29:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:40,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-08-14 14:29:40,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2024-08-14 14:29:40,406 INFO L87 Difference]: Start difference. First operand 2350 states and 3296 transitions. Second operand has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 4 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:29:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:41,221 INFO L93 Difference]: Finished difference Result 2702 states and 3703 transitions. [2024-08-14 14:29:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-14 14:29:41,222 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 4 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 112 [2024-08-14 14:29:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:41,227 INFO L225 Difference]: With dead ends: 2702 [2024-08-14 14:29:41,227 INFO L226 Difference]: Without dead ends: 2702 [2024-08-14 14:29:41,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=401, Invalid=2461, Unknown=0, NotChecked=0, Total=2862 [2024-08-14 14:29:41,229 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 186 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:41,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1378 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:29:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2024-08-14 14:29:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2564. [2024-08-14 14:29:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2554 states have (on average 1.3856695379796398) internal successors, (3539), 2555 states have internal predecessors, (3539), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3548 transitions. [2024-08-14 14:29:41,259 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3548 transitions. Word has length 112 [2024-08-14 14:29:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:41,260 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3548 transitions. [2024-08-14 14:29:41,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 4 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:29:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3548 transitions. [2024-08-14 14:29:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:41,264 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:41,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:41,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-08-14 14:29:41,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-08-14 14:29:41,465 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:41,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1125002265, now seen corresponding path program 1 times [2024-08-14 14:29:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:41,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841266855] [2024-08-14 14:29:41,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:42,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:42,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:29:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841266855] [2024-08-14 14:29:42,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841266855] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:29:42,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:29:42,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-08-14 14:29:42,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131852415] [2024-08-14 14:29:42,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:42,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-14 14:29:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:42,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-14 14:29:42,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-08-14 14:29:42,690 INFO L87 Difference]: Start difference. First operand 2564 states and 3548 transitions. Second operand has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 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:29:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:43,160 INFO L93 Difference]: Finished difference Result 2732 states and 3778 transitions. [2024-08-14 14:29:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 14:29:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 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 112 [2024-08-14 14:29:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:43,165 INFO L225 Difference]: With dead ends: 2732 [2024-08-14 14:29:43,166 INFO L226 Difference]: Without dead ends: 2732 [2024-08-14 14:29:43,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2024-08-14 14:29:43,167 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 214 mSDsluCounter, 2358 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:43,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 2547 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:29:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2024-08-14 14:29:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2537. [2024-08-14 14:29:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2527 states have (on average 1.3870201820340324) internal successors, (3505), 2528 states have internal predecessors, (3505), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3514 transitions. [2024-08-14 14:29:43,194 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3514 transitions. Word has length 112 [2024-08-14 14:29:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:43,194 INFO L495 AbstractCegarLoop]: Abstraction has 2537 states and 3514 transitions. [2024-08-14 14:29:43,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 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:29:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3514 transitions. [2024-08-14 14:29:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:43,199 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:43,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:43,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-08-14 14:29:43,199 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:43,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash 953060115, now seen corresponding path program 1 times [2024-08-14 14:29:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:43,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057731575] [2024-08-14 14:29:43,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:44,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:29:44,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:44,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057731575] [2024-08-14 14:29:44,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057731575] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:44,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540634373] [2024-08-14 14:29:44,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:44,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:44,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:44,615 INFO L229 MonitoredProcess]: Starting monitored process 18 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:29:44,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-08-14 14:29:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:44,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-14 14:29:45,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:29:45,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-14 14:29:45,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540634373] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:29:45,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:29:45,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 7] total 33 [2024-08-14 14:29:45,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934583578] [2024-08-14 14:29:45,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:29:45,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-08-14 14:29:45,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:45,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-08-14 14:29:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2024-08-14 14:29:45,561 INFO L87 Difference]: Start difference. First operand 2537 states and 3514 transitions. Second operand has 33 states, 33 states have (on average 6.696969696969697) internal successors, (221), 33 states have internal predecessors, (221), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:46,999 INFO L93 Difference]: Finished difference Result 2361 states and 3261 transitions. [2024-08-14 14:29:46,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-08-14 14:29:46,999 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.696969696969697) internal successors, (221), 33 states have internal predecessors, (221), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 112 [2024-08-14 14:29:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:47,004 INFO L225 Difference]: With dead ends: 2361 [2024-08-14 14:29:47,004 INFO L226 Difference]: Without dead ends: 2361 [2024-08-14 14:29:47,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=457, Invalid=3203, Unknown=0, NotChecked=0, Total=3660 [2024-08-14 14:29:47,005 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 538 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:47,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1475 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-08-14 14:29:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-08-14 14:29:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2283. [2024-08-14 14:29:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2273 states have (on average 1.3858336999560052) internal successors, (3150), 2274 states have internal predecessors, (3150), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3159 transitions. [2024-08-14 14:29:47,028 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3159 transitions. Word has length 112 [2024-08-14 14:29:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:47,029 INFO L495 AbstractCegarLoop]: Abstraction has 2283 states and 3159 transitions. [2024-08-14 14:29:47,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.696969696969697) internal successors, (221), 33 states have internal predecessors, (221), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3159 transitions. [2024-08-14 14:29:47,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:47,033 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:47,033 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:47,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-08-14 14:29:47,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-08-14 14:29:47,234 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:47,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:47,234 INFO L85 PathProgramCache]: Analyzing trace with hash 158069693, now seen corresponding path program 1 times [2024-08-14 14:29:47,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:47,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143820762] [2024-08-14 14:29:47,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:47,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:47,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:47,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:29:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:47,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143820762] [2024-08-14 14:29:47,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143820762] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:29:47,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:29:47,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-08-14 14:29:47,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792834431] [2024-08-14 14:29:47,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:47,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-14 14:29:47,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:47,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-14 14:29:47,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-08-14 14:29:47,931 INFO L87 Difference]: Start difference. First operand 2283 states and 3159 transitions. Second operand has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 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:29:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:48,308 INFO L93 Difference]: Finished difference Result 2893 states and 3945 transitions. [2024-08-14 14:29:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 14:29:48,309 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 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 112 [2024-08-14 14:29:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:48,312 INFO L225 Difference]: With dead ends: 2893 [2024-08-14 14:29:48,312 INFO L226 Difference]: Without dead ends: 2893 [2024-08-14 14:29:48,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-08-14 14:29:48,313 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 215 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:48,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1403 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:29:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2024-08-14 14:29:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2710. [2024-08-14 14:29:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2700 states have (on average 1.372962962962963) internal successors, (3707), 2701 states have internal predecessors, (3707), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3716 transitions. [2024-08-14 14:29:48,332 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3716 transitions. Word has length 112 [2024-08-14 14:29:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:48,332 INFO L495 AbstractCegarLoop]: Abstraction has 2710 states and 3716 transitions. [2024-08-14 14:29:48,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 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:29:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3716 transitions. [2024-08-14 14:29:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:48,337 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:48,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:48,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-08-14 14:29:48,338 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:48,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1789320544, now seen corresponding path program 1 times [2024-08-14 14:29:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670886] [2024-08-14 14:29:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:48,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:49,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:49,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:49,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:29:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670886] [2024-08-14 14:29:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670886] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141512278] [2024-08-14 14:29:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:49,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:49,106 INFO L229 MonitoredProcess]: Starting monitored process 19 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:29:49,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-08-14 14:29:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:49,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 109 conjunts are in the unsatisfiable core [2024-08-14 14:29:49,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-14 14:29:50,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141512278] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:50,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-14 14:29:50,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [17, 19] total 53 [2024-08-14 14:29:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443559892] [2024-08-14 14:29:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:50,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-14 14:29:50,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-14 14:29:50,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2529, Unknown=0, NotChecked=0, Total=2756 [2024-08-14 14:29:50,816 INFO L87 Difference]: Start difference. First operand 2710 states and 3716 transitions. Second operand has 21 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 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:29:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:51,610 INFO L93 Difference]: Finished difference Result 4736 states and 6502 transitions. [2024-08-14 14:29:51,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-08-14 14:29:51,610 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 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 112 [2024-08-14 14:29:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:51,617 INFO L225 Difference]: With dead ends: 4736 [2024-08-14 14:29:51,617 INFO L226 Difference]: Without dead ends: 4542 [2024-08-14 14:29:51,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=364, Invalid=4328, Unknown=0, NotChecked=0, Total=4692 [2024-08-14 14:29:51,619 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 667 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:51,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1948 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:29:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2024-08-14 14:29:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 2613. [2024-08-14 14:29:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2613 states, 2603 states have (on average 1.3753361505954669) internal successors, (3580), 2604 states have internal predecessors, (3580), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 3589 transitions. [2024-08-14 14:29:51,658 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 3589 transitions. Word has length 112 [2024-08-14 14:29:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:51,658 INFO L495 AbstractCegarLoop]: Abstraction has 2613 states and 3589 transitions. [2024-08-14 14:29:51,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 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:29:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3589 transitions. [2024-08-14 14:29:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:51,664 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:51,664 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:51,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-08-14 14:29:51,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-08-14 14:29:51,865 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:51,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1619649692, now seen corresponding path program 1 times [2024-08-14 14:29:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:51,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112185177] [2024-08-14 14:29:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-14 14:29:52,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:52,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112185177] [2024-08-14 14:29:52,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112185177] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:29:52,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:29:52,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:29:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785570292] [2024-08-14 14:29:52,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:52,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:29:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:52,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:29:52,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:29:52,374 INFO L87 Difference]: Start difference. First operand 2613 states and 3589 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:29:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:52,494 INFO L93 Difference]: Finished difference Result 2174 states and 2985 transitions. [2024-08-14 14:29:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:29:52,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2024-08-14 14:29:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:52,498 INFO L225 Difference]: With dead ends: 2174 [2024-08-14 14:29:52,498 INFO L226 Difference]: Without dead ends: 2174 [2024-08-14 14:29:52,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:29:52,499 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 71 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:52,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 325 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:29:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2024-08-14 14:29:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2174. [2024-08-14 14:29:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 2164 states have (on average 1.3752310536044363) internal successors, (2976), 2165 states have internal predecessors, (2976), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2985 transitions. [2024-08-14 14:29:52,520 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2985 transitions. Word has length 112 [2024-08-14 14:29:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:52,521 INFO L495 AbstractCegarLoop]: Abstraction has 2174 states and 2985 transitions. [2024-08-14 14:29:52,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:29:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2985 transitions. [2024-08-14 14:29:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-14 14:29:52,524 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:52,524 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:52,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-08-14 14:29:52,525 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:52,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:52,525 INFO L85 PathProgramCache]: Analyzing trace with hash -704378147, now seen corresponding path program 1 times [2024-08-14 14:29:52,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:52,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724102630] [2024-08-14 14:29:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:52,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:54,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:54,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-08-14 14:29:54,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:54,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724102630] [2024-08-14 14:29:54,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724102630] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:54,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72143831] [2024-08-14 14:29:54,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:54,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:54,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:54,117 INFO L229 MonitoredProcess]: Starting monitored process 20 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:29:54,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-08-14 14:29:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:54,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-14 14:29:54,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-14 14:29:54,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:29:54,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72143831] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:29:54,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:29:54,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2024-08-14 14:29:54,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162227679] [2024-08-14 14:29:54,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:54,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:29:54,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:54,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:29:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-08-14 14:29:54,860 INFO L87 Difference]: Start difference. First operand 2174 states and 2985 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:29:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:54,992 INFO L93 Difference]: Finished difference Result 1659 states and 2280 transitions. [2024-08-14 14:29:54,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:29:54,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2024-08-14 14:29:54,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:54,995 INFO L225 Difference]: With dead ends: 1659 [2024-08-14 14:29:54,995 INFO L226 Difference]: Without dead ends: 1653 [2024-08-14 14:29:54,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2024-08-14 14:29:54,996 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 69 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:54,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 349 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:29:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-08-14 14:29:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2024-08-14 14:29:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1643 states have (on average 1.3785757760194766) internal successors, (2265), 1644 states have internal predecessors, (2265), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2274 transitions. [2024-08-14 14:29:55,014 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2274 transitions. Word has length 112 [2024-08-14 14:29:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:55,014 INFO L495 AbstractCegarLoop]: Abstraction has 1653 states and 2274 transitions. [2024-08-14 14:29:55,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:29:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2274 transitions. [2024-08-14 14:29:55,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-14 14:29:55,018 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:55,018 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:55,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-08-14 14:29:55,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:55,219 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:55,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 253150287, now seen corresponding path program 1 times [2024-08-14 14:29:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:55,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336716977] [2024-08-14 14:29:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:56,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:56,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:56,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336716977] [2024-08-14 14:29:56,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336716977] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016425275] [2024-08-14 14:29:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:56,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:56,106 INFO L229 MonitoredProcess]: Starting monitored process 21 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:29:56,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-08-14 14:29:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:56,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 58 conjunts are in the unsatisfiable core [2024-08-14 14:29:56,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-14 14:29:56,854 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:29:56,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016425275] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:29:56,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:29:56,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 27 [2024-08-14 14:29:56,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494179407] [2024-08-14 14:29:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:29:56,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-14 14:29:56,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:56,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-14 14:29:56,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-08-14 14:29:56,855 INFO L87 Difference]: Start difference. First operand 1653 states and 2274 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:29:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:57,049 INFO L93 Difference]: Finished difference Result 2357 states and 3193 transitions. [2024-08-14 14:29:57,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 14:29:57,049 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2024-08-14 14:29:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:57,053 INFO L225 Difference]: With dead ends: 2357 [2024-08-14 14:29:57,053 INFO L226 Difference]: Without dead ends: 2357 [2024-08-14 14:29:57,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-08-14 14:29:57,054 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 81 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:57,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 824 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:29:57,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2024-08-14 14:29:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1977. [2024-08-14 14:29:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1967 states have (on average 1.369598373157092) internal successors, (2694), 1968 states have internal predecessors, (2694), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:29:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2703 transitions. [2024-08-14 14:29:57,076 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2703 transitions. Word has length 113 [2024-08-14 14:29:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:57,076 INFO L495 AbstractCegarLoop]: Abstraction has 1977 states and 2703 transitions. [2024-08-14 14:29:57,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:29:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2703 transitions. [2024-08-14 14:29:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-14 14:29:57,079 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:57,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:57,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-08-14 14:29:57,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-08-14 14:29:57,280 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:57,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash 292251788, now seen corresponding path program 1 times [2024-08-14 14:29:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:57,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212209501] [2024-08-14 14:29:57,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:57,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:57,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:29:57,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:57,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212209501] [2024-08-14 14:29:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212209501] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:57,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674148781] [2024-08-14 14:29:57,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:57,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:57,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:57,894 INFO L229 MonitoredProcess]: Starting monitored process 22 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:29:57,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-08-14 14:29:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:58,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 92 conjunts are in the unsatisfiable core [2024-08-14 14:29:58,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:29:59,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:30:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:30:03,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674148781] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:30:03,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:30:03,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 26] total 53 [2024-08-14 14:30:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844183416] [2024-08-14 14:30:03,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:30:03,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-08-14 14:30:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-08-14 14:30:03,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2448, Unknown=0, NotChecked=0, Total=2756 [2024-08-14 14:30:03,602 INFO L87 Difference]: Start difference. First operand 1977 states and 2703 transitions. Second operand has 53 states, 53 states have (on average 4.830188679245283) internal successors, (256), 53 states have internal predecessors, (256), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:08,458 INFO L93 Difference]: Finished difference Result 2357 states and 3236 transitions. [2024-08-14 14:30:08,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-08-14 14:30:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.830188679245283) internal successors, (256), 53 states have internal predecessors, (256), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 113 [2024-08-14 14:30:08,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:08,461 INFO L225 Difference]: With dead ends: 2357 [2024-08-14 14:30:08,461 INFO L226 Difference]: Without dead ends: 2354 [2024-08-14 14:30:08,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=830, Invalid=6826, Unknown=0, NotChecked=0, Total=7656 [2024-08-14 14:30:08,462 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 772 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:08,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 2405 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-08-14 14:30:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2024-08-14 14:30:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2248. [2024-08-14 14:30:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 2238 states have (on average 1.3802502234137624) internal successors, (3089), 2239 states have internal predecessors, (3089), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3098 transitions. [2024-08-14 14:30:08,485 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3098 transitions. Word has length 113 [2024-08-14 14:30:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:08,486 INFO L495 AbstractCegarLoop]: Abstraction has 2248 states and 3098 transitions. [2024-08-14 14:30:08,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.830188679245283) internal successors, (256), 53 states have internal predecessors, (256), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3098 transitions. [2024-08-14 14:30:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-14 14:30:08,489 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:08,490 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:08,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-08-14 14:30:08,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-08-14 14:30:08,691 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:08,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:08,692 INFO L85 PathProgramCache]: Analyzing trace with hash 539943916, now seen corresponding path program 1 times [2024-08-14 14:30:08,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:08,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933652161] [2024-08-14 14:30:08,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:08,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:09,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:09,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:30:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:09,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:30:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:30:09,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:09,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933652161] [2024-08-14 14:30:09,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933652161] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:30:09,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:30:09,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-08-14 14:30:09,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818946900] [2024-08-14 14:30:09,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:30:09,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 14:30:09,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:09,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 14:30:09,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-08-14 14:30:09,545 INFO L87 Difference]: Start difference. First operand 2248 states and 3098 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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:30:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:09,759 INFO L93 Difference]: Finished difference Result 2284 states and 3138 transitions. [2024-08-14 14:30:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 14:30:09,760 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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 113 [2024-08-14 14:30:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:09,762 INFO L225 Difference]: With dead ends: 2284 [2024-08-14 14:30:09,762 INFO L226 Difference]: Without dead ends: 2284 [2024-08-14 14:30:09,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-08-14 14:30:09,763 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 157 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:09,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 841 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:30:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2024-08-14 14:30:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2232. [2024-08-14 14:30:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2222 states have (on average 1.3793879387938794) internal successors, (3065), 2223 states have internal predecessors, (3065), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3074 transitions. [2024-08-14 14:30:09,784 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3074 transitions. Word has length 113 [2024-08-14 14:30:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:09,785 INFO L495 AbstractCegarLoop]: Abstraction has 2232 states and 3074 transitions. [2024-08-14 14:30:09,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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:30:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3074 transitions. [2024-08-14 14:30:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-14 14:30:09,788 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:09,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:09,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-08-14 14:30:09,789 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:09,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1682510000, now seen corresponding path program 1 times [2024-08-14 14:30:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:09,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369330210] [2024-08-14 14:30:09,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:11,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:11,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:30:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:11,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:30:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:30:11,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:11,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369330210] [2024-08-14 14:30:11,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369330210] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:11,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322994175] [2024-08-14 14:30:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:11,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:11,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:11,563 INFO L229 MonitoredProcess]: Starting monitored process 23 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:30:11,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-08-14 14:30:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:12,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 50 conjunts are in the unsatisfiable core [2024-08-14 14:30:12,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-14 14:30:12,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:30:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322994175] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:17,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-14 14:30:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 30 [2024-08-14 14:30:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365669982] [2024-08-14 14:30:17,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-14 14:30:17,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-08-14 14:30:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:17,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-08-14 14:30:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2024-08-14 14:30:17,403 INFO L87 Difference]: Start difference. First operand 2232 states and 3074 transitions. Second operand has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 4 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:30:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:19,425 INFO L93 Difference]: Finished difference Result 2342 states and 3202 transitions. [2024-08-14 14:30:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-14 14:30:19,426 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 4 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 113 [2024-08-14 14:30:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:19,428 INFO L225 Difference]: With dead ends: 2342 [2024-08-14 14:30:19,428 INFO L226 Difference]: Without dead ends: 2342 [2024-08-14 14:30:19,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=468, Invalid=3692, Unknown=0, NotChecked=0, Total=4160 [2024-08-14 14:30:19,429 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 250 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:19,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1703 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-08-14 14:30:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2024-08-14 14:30:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2229. [2024-08-14 14:30:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2219 states have (on average 1.3799008562415502) internal successors, (3062), 2220 states have internal predecessors, (3062), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 3071 transitions. [2024-08-14 14:30:19,452 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 3071 transitions. Word has length 113 [2024-08-14 14:30:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:19,453 INFO L495 AbstractCegarLoop]: Abstraction has 2229 states and 3071 transitions. [2024-08-14 14:30:19,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 4 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:30:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 3071 transitions. [2024-08-14 14:30:19,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-14 14:30:19,456 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:19,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:19,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-08-14 14:30:19,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:19,657 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:19,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1615384943, now seen corresponding path program 1 times [2024-08-14 14:30:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:19,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493197457] [2024-08-14 14:30:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:20,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:30:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:20,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:30:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-14 14:30:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:20,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493197457] [2024-08-14 14:30:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493197457] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:30:20,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:30:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:30:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162961569] [2024-08-14 14:30:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:30:20,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:30:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:20,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:30:20,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:30:20,076 INFO L87 Difference]: Start difference. First operand 2229 states and 3071 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:30:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:20,160 INFO L93 Difference]: Finished difference Result 1843 states and 2526 transitions. [2024-08-14 14:30:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:30:20,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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 113 [2024-08-14 14:30:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:20,163 INFO L225 Difference]: With dead ends: 1843 [2024-08-14 14:30:20,163 INFO L226 Difference]: Without dead ends: 1843 [2024-08-14 14:30:20,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:30:20,163 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 10 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:20,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 381 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:30:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-08-14 14:30:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1843. [2024-08-14 14:30:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1833 states have (on average 1.3731587561374796) internal successors, (2517), 1834 states have internal predecessors, (2517), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2526 transitions. [2024-08-14 14:30:20,182 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2526 transitions. Word has length 113 [2024-08-14 14:30:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:20,182 INFO L495 AbstractCegarLoop]: Abstraction has 1843 states and 2526 transitions. [2024-08-14 14:30:20,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:30:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2526 transitions. [2024-08-14 14:30:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-14 14:30:20,186 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:20,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:20,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-08-14 14:30:20,187 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:20,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash -121695169, now seen corresponding path program 1 times [2024-08-14 14:30:20,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:20,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105952162] [2024-08-14 14:30:20,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:20,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:21,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:21,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:30:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:21,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:30:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:30:21,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:21,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105952162] [2024-08-14 14:30:21,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105952162] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:21,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625834085] [2024-08-14 14:30:21,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:21,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:21,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:21,851 INFO L229 MonitoredProcess]: Starting monitored process 24 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:30:21,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-08-14 14:30:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:22,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 57 conjunts are in the unsatisfiable core [2024-08-14 14:30:22,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:30:22,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:30:29,408 WARN L293 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-08-14 14:30:37,146 WARN L293 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-08-14 14:30:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 23 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:30:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625834085] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:30:37,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:30:37,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 49 [2024-08-14 14:30:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38995555] [2024-08-14 14:30:37,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:30:37,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-08-14 14:30:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-08-14 14:30:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2113, Unknown=0, NotChecked=0, Total=2352 [2024-08-14 14:30:37,763 INFO L87 Difference]: Start difference. First operand 1843 states and 2526 transitions. Second operand has 49 states, 49 states have (on average 4.979591836734694) internal successors, (244), 49 states have internal predecessors, (244), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:39,482 INFO L93 Difference]: Finished difference Result 2048 states and 2807 transitions. [2024-08-14 14:30:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-08-14 14:30:39,482 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.979591836734694) internal successors, (244), 49 states have internal predecessors, (244), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 113 [2024-08-14 14:30:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:39,485 INFO L225 Difference]: With dead ends: 2048 [2024-08-14 14:30:39,485 INFO L226 Difference]: Without dead ends: 2042 [2024-08-14 14:30:39,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=558, Invalid=4134, Unknown=0, NotChecked=0, Total=4692 [2024-08-14 14:30:39,487 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 529 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:39,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2592 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-08-14 14:30:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2024-08-14 14:30:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1949. [2024-08-14 14:30:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1939 states have (on average 1.376998452810727) internal successors, (2670), 1940 states have internal predecessors, (2670), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2679 transitions. [2024-08-14 14:30:39,508 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2679 transitions. Word has length 113 [2024-08-14 14:30:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:39,508 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 2679 transitions. [2024-08-14 14:30:39,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.979591836734694) internal successors, (244), 49 states have internal predecessors, (244), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2679 transitions. [2024-08-14 14:30:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-14 14:30:39,511 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:39,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:39,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-08-14 14:30:39,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:39,713 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:39,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash 867923169, now seen corresponding path program 1 times [2024-08-14 14:30:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:39,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101140908] [2024-08-14 14:30:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:41,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:41,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:30:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:30:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:30:41,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101140908] [2024-08-14 14:30:41,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101140908] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156384110] [2024-08-14 14:30:41,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:41,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:41,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:41,226 INFO L229 MonitoredProcess]: Starting monitored process 25 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:30:41,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-08-14 14:30:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:41,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 44 conjunts are in the unsatisfiable core [2024-08-14 14:30:41,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-14 14:30:42,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:30:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156384110] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:30:42,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:30:42,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [20] total 33 [2024-08-14 14:30:42,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316468857] [2024-08-14 14:30:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:30:42,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-14 14:30:42,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-14 14:30:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056 [2024-08-14 14:30:42,042 INFO L87 Difference]: Start difference. First operand 1949 states and 2679 transitions. Second operand has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 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:30:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:42,174 INFO L93 Difference]: Finished difference Result 2109 states and 2904 transitions. [2024-08-14 14:30:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-14 14:30:42,174 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 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 113 [2024-08-14 14:30:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:42,176 INFO L225 Difference]: With dead ends: 2109 [2024-08-14 14:30:42,177 INFO L226 Difference]: Without dead ends: 2109 [2024-08-14 14:30:42,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2024-08-14 14:30:42,177 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 162 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:42,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1060 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:30:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2024-08-14 14:30:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1964. [2024-08-14 14:30:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1954 states have (on average 1.3792221084953942) internal successors, (2695), 1955 states have internal predecessors, (2695), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2704 transitions. [2024-08-14 14:30:42,196 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2704 transitions. Word has length 113 [2024-08-14 14:30:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:42,196 INFO L495 AbstractCegarLoop]: Abstraction has 1964 states and 2704 transitions. [2024-08-14 14:30:42,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 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:30:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2704 transitions. [2024-08-14 14:30:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-14 14:30:42,199 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:42,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:42,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-08-14 14:30:42,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-08-14 14:30:42,400 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:42,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:42,401 INFO L85 PathProgramCache]: Analyzing trace with hash -672568097, now seen corresponding path program 1 times [2024-08-14 14:30:42,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:42,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647773659] [2024-08-14 14:30:42,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:42,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:30:42,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:30:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:30:42,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:30:42,734 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:30:42,735 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:30:42,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-08-14 14:30:42,740 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:42,743 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:30:42,827 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:30:42 BoogieIcfgContainer [2024-08-14 14:30:42,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:30:42,828 INFO L158 Benchmark]: Toolchain (without parser) took 159052.06ms. Allocated memory was 161.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 80.4MB in the beginning and 737.0MB in the end (delta: -656.6MB). Peak memory consumption was 404.5MB. Max. memory is 16.1GB. [2024-08-14 14:30:42,829 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 161.5MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:30:42,830 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 161.5MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:30:42,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.15ms. Allocated memory is still 161.5MB. Free memory was 80.3MB in the beginning and 126.2MB in the end (delta: -45.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-08-14 14:30:42,830 INFO L158 Benchmark]: Boogie Preprocessor took 78.65ms. Allocated memory is still 161.5MB. Free memory was 126.2MB in the beginning and 124.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:30:42,830 INFO L158 Benchmark]: IcfgBuilder took 776.05ms. Allocated memory is still 161.5MB. Free memory was 123.0MB in the beginning and 96.0MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-08-14 14:30:42,830 INFO L158 Benchmark]: TraceAbstraction took 157753.98ms. Allocated memory was 161.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 96.0MB in the beginning and 737.0MB in the end (delta: -641.0MB). Peak memory consumption was 419.1MB. Max. memory is 16.1GB. [2024-08-14 14:30:42,831 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.36ms. Allocated memory is still 161.5MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 161.5MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.15ms. Allocated memory is still 161.5MB. Free memory was 80.3MB in the beginning and 126.2MB in the end (delta: -45.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.65ms. Allocated memory is still 161.5MB. Free memory was 126.2MB in the beginning and 124.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 776.05ms. Allocated memory is still 161.5MB. Free memory was 123.0MB in the beginning and 96.0MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 157753.98ms. Allocated memory was 161.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 96.0MB in the beginning and 737.0MB in the end (delta: -641.0MB). Peak memory consumption was 419.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 170. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 5); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (5 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L35] const SORT_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 31); [L36] const SORT_22 msb_SORT_22 = (SORT_22)1 << (31 - 1); [L38] const SORT_29 mask_SORT_29 = (SORT_29)-1 >> (sizeof(SORT_29) * 8 - 30); [L39] const SORT_29 msb_SORT_29 = (SORT_29)1 << (30 - 1); [L41] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 2); [L42] const SORT_31 msb_SORT_31 = (SORT_31)1 << (2 - 1); [L44] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 28); [L45] const SORT_37 msb_SORT_37 = (SORT_37)1 << (28 - 1); [L47] const SORT_39 mask_SORT_39 = (SORT_39)-1 >> (sizeof(SORT_39) * 8 - 4); [L48] const SORT_39 msb_SORT_39 = (SORT_39)1 << (4 - 1); [L50] const SORT_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 24); [L51] const SORT_45 msb_SORT_45 = (SORT_45)1 << (24 - 1); [L53] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 8); [L54] const SORT_47 msb_SORT_47 = (SORT_47)1 << (8 - 1); [L56] const SORT_53 mask_SORT_53 = (SORT_53)-1 >> (sizeof(SORT_53) * 8 - 16); [L57] const SORT_53 msb_SORT_53 = (SORT_53)1 << (16 - 1); [L59] const SORT_5 var_7 = 0; [L60] const SORT_5 var_10 = 2863311530; [L61] const SORT_3 var_15 = 1; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L67] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 [L67] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_7=0] [L67] SORT_5 state_8 = __VERIFIER_nondet_uint() & mask_SORT_5; [L68] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 [L68] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_7=0] [L68] SORT_5 state_19 = __VERIFIER_nondet_uint() & mask_SORT_5; [L70] SORT_5 init_9_arg_1 = var_7; [L71] state_8 = init_9_arg_1 [L72] SORT_5 init_20_arg_1 = var_7; [L73] state_19 = init_20_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, state_8=0, var_10=2863311530, var_15=1] [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_17_arg_0=1, var_17_arg_1=-256] [L90] EXPR var_17_arg_0 & var_17_arg_1 [L90] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1] [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] EXPR var_17 & mask_SORT_3 [L91] EXPR var_17 & mask_SORT_3 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1] [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(!(bad_18_arg_0)) VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1] [L95] SORT_1 var_57_arg_0 = input_2; [L96] SORT_3 var_57 = var_57_arg_0 >> 4; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_57=0] [L97] EXPR var_57 & mask_SORT_3 [L97] EXPR var_57 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1] [L97] var_57 = var_57 & mask_SORT_3 [L98] SORT_1 var_50_arg_0 = input_2; [L99] SORT_3 var_50 = var_50_arg_0 >> 3; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_50=0, var_57=0] [L100] EXPR var_50 & mask_SORT_3 [L100] EXPR var_50 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_57=0] [L100] var_50 = var_50 & mask_SORT_3 [L101] SORT_1 var_42_arg_0 = input_2; [L102] SORT_3 var_42 = var_42_arg_0 >> 2; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_42=0, var_50=0, var_57=0] [L103] EXPR var_42 & mask_SORT_3 [L103] EXPR var_42 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_50=0, var_57=0] [L103] var_42 = var_42 & mask_SORT_3 [L104] SORT_1 var_34_arg_0 = input_2; [L105] SORT_3 var_34 = var_34_arg_0 >> 1; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_34=0, var_42=0, var_50=0, var_57=0] [L106] EXPR var_34 & mask_SORT_3 [L106] EXPR var_34 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_42=0, var_50=0, var_57=0] [L106] var_34 = var_34 & mask_SORT_3 [L107] SORT_1 var_26_arg_0 = input_2; [L108] SORT_3 var_26 = var_26_arg_0 >> 0; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L109] EXPR var_26 & mask_SORT_3 [L109] EXPR var_26 & mask_SORT_3 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_34=0, var_42=0, var_50=0, var_57=0] [L109] var_26 = var_26 & mask_SORT_3 [L110] SORT_5 var_24_arg_0 = state_19; [L111] SORT_3 var_24 = var_24_arg_0 >> 0; [L112] SORT_5 var_23_arg_0 = state_19; [L113] SORT_22 var_23 = var_23_arg_0 >> 1; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_23=0, var_24=0, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L114] EXPR var_23 & mask_SORT_22 [L114] EXPR var_23 & mask_SORT_22 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_24=0, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L114] var_23 = var_23 & mask_SORT_22 [L115] SORT_3 var_25_arg_0 = var_24; [L116] SORT_22 var_25_arg_1 = var_23; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_25_arg_0=0, var_25_arg_1=0, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L117] EXPR ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1 [L117] EXPR ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L117] SORT_5 var_25 = ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1; [L118] SORT_3 var_27_arg_0 = var_26; [L119] SORT_5 var_27_arg_1 = var_25; [L120] SORT_5 var_27_arg_2 = state_19; [L121] SORT_5 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L122] SORT_5 var_32_arg_0 = var_27; [L123] SORT_31 var_32 = var_32_arg_0 >> 0; [L124] SORT_5 var_30_arg_0 = var_27; [L125] SORT_29 var_30 = var_30_arg_0 >> 2; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=0, var_30=0, var_32=0, var_34=0, var_42=0, var_50=0, var_57=0] [L126] EXPR var_30 & mask_SORT_29 [L126] EXPR var_30 & mask_SORT_29 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=0, var_32=0, var_34=0, var_42=0, var_50=0, var_57=0] [L126] var_30 = var_30 & mask_SORT_29 [L127] SORT_31 var_33_arg_0 = var_32; [L128] SORT_29 var_33_arg_1 = var_30; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=0, var_33_arg_0=0, var_33_arg_1=0, var_34=0, var_42=0, var_50=0, var_57=0] [L129] EXPR ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1 [L129] EXPR ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=0, var_34=0, var_42=0, var_50=0, var_57=0] [L129] SORT_5 var_33 = ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1; [L130] SORT_3 var_35_arg_0 = var_34; [L131] SORT_5 var_35_arg_1 = var_33; [L132] SORT_5 var_35_arg_2 = var_27; [L133] SORT_5 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L134] SORT_5 var_40_arg_0 = var_35; [L135] SORT_39 var_40 = var_40_arg_0 >> 0; [L136] SORT_5 var_38_arg_0 = var_35; [L137] SORT_37 var_38 = var_38_arg_0 >> 4; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=0, var_38=0, var_40=0, var_42=0, var_50=0, var_57=0] [L138] EXPR var_38 & mask_SORT_37 [L138] EXPR var_38 & mask_SORT_37 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=0, var_40=0, var_42=0, var_50=0, var_57=0] [L138] var_38 = var_38 & mask_SORT_37 [L139] SORT_39 var_41_arg_0 = var_40; [L140] SORT_37 var_41_arg_1 = var_38; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=0, var_41_arg_0=0, var_41_arg_1=0, var_42=0, var_50=0, var_57=0] [L141] EXPR ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1 [L141] EXPR ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=0, var_42=0, var_50=0, var_57=0] [L141] SORT_5 var_41 = ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1; [L142] SORT_3 var_43_arg_0 = var_42; [L143] SORT_5 var_43_arg_1 = var_41; [L144] SORT_5 var_43_arg_2 = var_35; [L145] SORT_5 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L146] SORT_5 var_48_arg_0 = var_43; [L147] SORT_47 var_48 = var_48_arg_0 >> 0; [L148] SORT_5 var_46_arg_0 = var_43; [L149] SORT_45 var_46 = var_46_arg_0 >> 8; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=0, var_46=0, var_48=0, var_50=0, var_57=0] [L150] EXPR var_46 & mask_SORT_45 [L150] EXPR var_46 & mask_SORT_45 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=0, var_48=0, var_50=0, var_57=0] [L150] var_46 = var_46 & mask_SORT_45 [L151] SORT_47 var_49_arg_0 = var_48; [L152] SORT_45 var_49_arg_1 = var_46; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=0, var_49_arg_0=0, var_49_arg_1=0, var_50=0, var_57=0] [L153] EXPR ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1 [L153] EXPR ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=0, var_50=0, var_57=0] [L153] SORT_5 var_49 = ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1; [L154] SORT_3 var_51_arg_0 = var_50; [L155] SORT_5 var_51_arg_1 = var_49; [L156] SORT_5 var_51_arg_2 = var_43; [L157] SORT_5 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L158] SORT_5 var_55_arg_0 = var_51; [L159] SORT_53 var_55 = var_55_arg_0 >> 0; [L160] SORT_5 var_54_arg_0 = var_51; [L161] SORT_53 var_54 = var_54_arg_0 >> 16; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=0, var_54=0, var_55=0, var_57=0] [L162] EXPR var_54 & mask_SORT_53 [L162] EXPR var_54 & mask_SORT_53 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=0, var_55=0, var_57=0] [L162] var_54 = var_54 & mask_SORT_53 [L163] SORT_53 var_56_arg_0 = var_55; [L164] SORT_53 var_56_arg_1 = var_54; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=0, var_56_arg_0=0, var_56_arg_1=0, var_57=0] [L165] EXPR ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1 [L165] EXPR ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=0, var_57=0] [L165] SORT_5 var_56 = ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1; [L166] SORT_3 var_58_arg_0 = var_57; [L167] SORT_5 var_58_arg_1 = var_56; [L168] SORT_5 var_58_arg_2 = var_51; [L169] SORT_5 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_58=0] [L170] EXPR var_58 & mask_SORT_5 [L170] EXPR var_58 & mask_SORT_5 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1] [L170] var_58 = var_58 & mask_SORT_5 [L171] SORT_5 next_60_arg_1 = var_58; [L172] SORT_5 next_61_arg_1 = input_6; [L174] state_8 = next_60_arg_1 [L175] state_19 = next_61_arg_1 [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_17_arg_0=1, var_17_arg_1=-256] [L90] EXPR var_17_arg_0 & var_17_arg_1 [L90] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1] [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] EXPR var_17 & mask_SORT_3 [L91] EXPR var_17 & mask_SORT_3 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1] [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(!(bad_18_arg_0)) VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1] [L95] SORT_1 var_57_arg_0 = input_2; [L96] SORT_3 var_57 = var_57_arg_0 >> 4; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_57=0] [L97] EXPR var_57 & mask_SORT_3 [L97] EXPR var_57 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1] [L97] var_57 = var_57 & mask_SORT_3 [L98] SORT_1 var_50_arg_0 = input_2; [L99] SORT_3 var_50 = var_50_arg_0 >> 3; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_50=0, var_57=0] [L100] EXPR var_50 & mask_SORT_3 [L100] EXPR var_50 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_57=0] [L100] var_50 = var_50 & mask_SORT_3 [L101] SORT_1 var_42_arg_0 = input_2; [L102] SORT_3 var_42 = var_42_arg_0 >> 2; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_42=0, var_50=0, var_57=0] [L103] EXPR var_42 & mask_SORT_3 [L103] EXPR var_42 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_50=0, var_57=0] [L103] var_42 = var_42 & mask_SORT_3 [L104] SORT_1 var_34_arg_0 = input_2; [L105] SORT_3 var_34 = var_34_arg_0 >> 1; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_34=0, var_42=0, var_50=0, var_57=0] [L106] EXPR var_34 & mask_SORT_3 [L106] EXPR var_34 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_42=0, var_50=0, var_57=0] [L106] var_34 = var_34 & mask_SORT_3 [L107] SORT_1 var_26_arg_0 = input_2; [L108] SORT_3 var_26 = var_26_arg_0 >> 0; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L109] EXPR var_26 & mask_SORT_3 [L109] EXPR var_26 & mask_SORT_3 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_34=0, var_42=0, var_50=0, var_57=0] [L109] var_26 = var_26 & mask_SORT_3 [L110] SORT_5 var_24_arg_0 = state_19; [L111] SORT_3 var_24 = var_24_arg_0 >> 0; [L112] SORT_5 var_23_arg_0 = state_19; [L113] SORT_22 var_23 = var_23_arg_0 >> 1; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_23=2147450880, var_24=4294901760, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L114] EXPR var_23 & mask_SORT_22 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_23=2147450880, var_24=4294901760, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L114] EXPR var_23 & mask_SORT_22 [L114] EXPR var_23 & mask_SORT_22 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_24=4294901760, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L114] var_23 = var_23 & mask_SORT_22 [L115] SORT_3 var_25_arg_0 = var_24; [L116] SORT_22 var_25_arg_1 = var_23; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_25_arg_0=4294901760, var_25_arg_1=4294967298, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L117] EXPR ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1 [L117] EXPR ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L117] SORT_5 var_25 = ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1; [L118] SORT_3 var_27_arg_0 = var_26; [L119] SORT_5 var_27_arg_1 = var_25; [L120] SORT_5 var_27_arg_2 = state_19; [L121] SORT_5 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L122] SORT_5 var_32_arg_0 = var_27; [L123] SORT_31 var_32 = var_32_arg_0 >> 0; [L124] SORT_5 var_30_arg_0 = var_27; [L125] SORT_29 var_30 = var_30_arg_0 >> 2; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=4294901760, var_30=1073725440, var_32=4294901760, var_34=0, var_42=0, var_50=0, var_57=0] [L126] EXPR var_30 & mask_SORT_29 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=4294901760, var_30=1073725440, var_32=4294901760, var_34=0, var_42=0, var_50=0, var_57=0] [L126] EXPR var_30 & mask_SORT_29 [L126] EXPR var_30 & mask_SORT_29 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=4294901760, var_32=4294901760, var_34=0, var_42=0, var_50=0, var_57=0] [L126] var_30 = var_30 & mask_SORT_29 [L127] SORT_31 var_33_arg_0 = var_32; [L128] SORT_29 var_33_arg_1 = var_30; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=4294901760, var_33_arg_0=4294901760, var_33_arg_1=1073725439, var_34=0, var_42=0, var_50=0, var_57=0] [L129] EXPR ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1 [L129] EXPR ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=4294901760, var_34=0, var_42=0, var_50=0, var_57=0] [L129] SORT_5 var_33 = ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1; [L130] SORT_3 var_35_arg_0 = var_34; [L131] SORT_5 var_35_arg_1 = var_33; [L132] SORT_5 var_35_arg_2 = var_27; [L133] SORT_5 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L134] SORT_5 var_40_arg_0 = var_35; [L135] SORT_39 var_40 = var_40_arg_0 >> 0; [L136] SORT_5 var_38_arg_0 = var_35; [L137] SORT_37 var_38 = var_38_arg_0 >> 4; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=4294901760, var_38=268431360, var_40=4294901760, var_42=0, var_50=0, var_57=0] [L138] EXPR var_38 & mask_SORT_37 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=4294901760, var_38=268431360, var_40=4294901760, var_42=0, var_50=0, var_57=0] [L138] EXPR var_38 & mask_SORT_37 [L138] EXPR var_38 & mask_SORT_37 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=4294901760, var_40=4294901760, var_42=0, var_50=0, var_57=0] [L138] var_38 = var_38 & mask_SORT_37 [L139] SORT_39 var_41_arg_0 = var_40; [L140] SORT_37 var_41_arg_1 = var_38; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=4294901760, var_41_arg_0=4294901760, var_41_arg_1=-4294967296, var_42=0, var_50=0, var_57=0] [L141] EXPR ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1 [L141] EXPR ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=4294901760, var_42=0, var_50=0, var_57=0] [L141] SORT_5 var_41 = ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1; [L142] SORT_3 var_43_arg_0 = var_42; [L143] SORT_5 var_43_arg_1 = var_41; [L144] SORT_5 var_43_arg_2 = var_35; [L145] SORT_5 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L146] SORT_5 var_48_arg_0 = var_43; [L147] SORT_47 var_48 = var_48_arg_0 >> 0; [L148] SORT_5 var_46_arg_0 = var_43; [L149] SORT_45 var_46 = var_46_arg_0 >> 8; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=4294901760, var_46=16776960, var_48=4294901760, var_50=0, var_57=0] [L150] EXPR var_46 & mask_SORT_45 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=4294901760, var_46=16776960, var_48=4294901760, var_50=0, var_57=0] [L150] EXPR var_46 & mask_SORT_45 [L150] EXPR var_46 & mask_SORT_45 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=4294901760, var_48=4294901760, var_50=0, var_57=0] [L150] var_46 = var_46 & mask_SORT_45 [L151] SORT_47 var_49_arg_0 = var_48; [L152] SORT_45 var_49_arg_1 = var_46; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=4294901760, var_49_arg_0=4294901760, var_49_arg_1=4294967297, var_50=0, var_57=0] [L153] EXPR ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1 [L153] EXPR ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=4294901760, var_50=0, var_57=0] [L153] SORT_5 var_49 = ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1; [L154] SORT_3 var_51_arg_0 = var_50; [L155] SORT_5 var_51_arg_1 = var_49; [L156] SORT_5 var_51_arg_2 = var_43; [L157] SORT_5 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L158] SORT_5 var_55_arg_0 = var_51; [L159] SORT_53 var_55 = var_55_arg_0 >> 0; [L160] SORT_5 var_54_arg_0 = var_51; [L161] SORT_53 var_54 = var_54_arg_0 >> 16; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=4294901760, var_54=65535, var_55=4294901760, var_57=0] [L162] EXPR var_54 & mask_SORT_53 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=4294901760, var_54=65535, var_55=4294901760, var_57=0] [L162] EXPR var_54 & mask_SORT_53 [L162] EXPR var_54 & mask_SORT_53 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=4294901760, var_55=4294901760, var_57=0] [L162] var_54 = var_54 & mask_SORT_53 [L163] SORT_53 var_56_arg_0 = var_55; [L164] SORT_53 var_56_arg_1 = var_54; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=4294901760, var_56_arg_0=4294901760, var_56_arg_1=65535, var_57=0] [L165] EXPR ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1 [L165] EXPR ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=4294901760, var_57=0] [L165] SORT_5 var_56 = ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1; [L166] SORT_3 var_58_arg_0 = var_57; [L167] SORT_5 var_58_arg_1 = var_56; [L168] SORT_5 var_58_arg_2 = var_51; [L169] SORT_5 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_58=4294901760] [L170] EXPR var_58 & mask_SORT_5 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_58=4294901760] [L170] EXPR var_58 & mask_SORT_5 [L170] EXPR var_58 & mask_SORT_5 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1] [L170] var_58 = var_58 & mask_SORT_5 [L171] SORT_5 next_60_arg_1 = var_58; [L172] SORT_5 next_61_arg_1 = input_6; [L174] state_8 = next_60_arg_1 [L175] state_19 = next_61_arg_1 [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1, var_17_arg_0=1, var_17_arg_1=-255] [L90] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1, var_17_arg_0=1, var_17_arg_1=-255] [L90] EXPR var_17_arg_0 & var_17_arg_1 [L90] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1] [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] EXPR var_17 & mask_SORT_3 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1, var_17=1] [L91] EXPR var_17 & mask_SORT_3 [L91] EXPR var_17 & mask_SORT_3 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1] [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=1, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_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, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 157.6s, OverallIterations: 39, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 35.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11245 SdHoareTripleChecker+Valid, 19.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11235 mSDsluCounter, 41022 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36911 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22749 IncrementalHoareTripleChecker+Invalid, 23046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 4111 mSDtfsCounter, 22749 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5704 GetRequests, 4390 SyntacticMatches, 8 SemanticMatches, 1306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18424 ImplicationChecksByTransitivity, 43.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2710occurred in iteration=28, InterpolantAutomatonStates: 707, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 38 MinimizatonAttempts, 5309 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 103.0s InterpolantComputationTime, 7001 NumberOfCodeBlocks, 7001 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 8477 ConstructedInterpolants, 22 QuantifiedInterpolants, 90207 SizeOfPredicates, 88 NumberOfNonLiveVariables, 15216 ConjunctsInSsa, 1378 ConjunctsInUnsatCore, 77 InterpolantComputations, 25 PerfectInterpolantSequences, 4036/4543 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:30:42,896 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.vis_QF_BV_rotate32.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_rotate32.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:30:45,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:30:45,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-14 14:30:45,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:30:45,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:30:45,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:30:45,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:30:45,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:30:45,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:30:45,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:30:45,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:30:45,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:30:45,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:30:45,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:30:45,261 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:30:45,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:30:45,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:30:45,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:30:45,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:30:45,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:30:45,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:30:45,266 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:30:45,267 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:30:45,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:30:45,267 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:30:45,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:30:45,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:30:45,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:30:45,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:30:45,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:30:45,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:30:45,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:30:45,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:30:45,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:30:45,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:30:45,272 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:30:45,272 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:30:45,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:30:45,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:30:45,273 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:30:45,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:30:45,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:30:45,273 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:30:45,274 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:30:45,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:30:45,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:30:45,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:30:45,633 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:30:45,634 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:30:45,636 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.vis_QF_BV_rotate32.yml/witness.yml [2024-08-14 14:30:45,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:30:45,713 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:30:45,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2024-08-14 14:30:47,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:30:47,570 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:30:47,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2024-08-14 14:30:47,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/115c9ad65/b61bfd41a495440dacfd01b91bf9f540/FLAG57f0ba45a [2024-08-14 14:30:47,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/115c9ad65/b61bfd41a495440dacfd01b91bf9f540 [2024-08-14 14:30:47,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:30:47,603 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:30:47,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:30:47,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:30:47,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:30:47,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:45" (1/2) ... [2024-08-14 14:30:47,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ef838 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:47, skipping insertion in model container [2024-08-14 14:30:47,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:45" (1/2) ... [2024-08-14 14:30:47,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5d50d7d3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:30:47, skipping insertion in model container [2024-08-14 14:30:47,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:30:47" (2/2) ... [2024-08-14 14:30:47,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ef838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:47, skipping insertion in model container [2024-08-14 14:30:47,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:30:47" (2/2) ... [2024-08-14 14:30:47,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:30:47,807 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.vis_QF_BV_rotate32.c[1258,1271] [2024-08-14 14:30:47,899 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:30:47,915 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:30:47,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.vis_QF_BV_rotate32.c[1258,1271] [2024-08-14 14:30:47,978 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:30:48,010 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:30:48,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48 WrapperNode [2024-08-14 14:30:48,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:30:48,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:30:48,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:30:48,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:30:48,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48" (1/1) ... [2024-08-14 14:30:48,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48" (1/1) ... [2024-08-14 14:30:48,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48" (1/1) ... [2024-08-14 14:30:48,062 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:30:48,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48" (1/1) ... [2024-08-14 14:30:48,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48" (1/1) ... [2024-08-14 14:30:48,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48" (1/1) ... [2024-08-14 14:30:48,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48" (1/1) ... [2024-08-14 14:30:48,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48" (1/1) ... [2024-08-14 14:30:48,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:30:48,088 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:30:48,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:30:48,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:30:48,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48" (1/1) ... [2024-08-14 14:30:48,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:30:48,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:48,123 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:30:48,126 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:30:48,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:30:48,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:30:48,175 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:30:48,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:30:48,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:30:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:30:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:30:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:30:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:30:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:30:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:30:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:30:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:30:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:30:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:30:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:30:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:30:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:30:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:30:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:30:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:30:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:30:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:30:48,288 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:30:48,290 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:30:48,652 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-08-14 14:30:48,653 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:30:48,664 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:30:48,664 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:30:48,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:30:48 BoogieIcfgContainer [2024-08-14 14:30:48,666 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:30:48,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:30:48,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:30:48,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:30:48,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:45" (1/4) ... [2024-08-14 14:30:48,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351a18d4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:30:48, skipping insertion in model container [2024-08-14 14:30:48,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:30:47" (2/4) ... [2024-08-14 14:30:48,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351a18d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:30:48, skipping insertion in model container [2024-08-14 14:30:48,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:30:48" (3/4) ... [2024-08-14 14:30:48,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351a18d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:30:48, skipping insertion in model container [2024-08-14 14:30:48,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:30:48" (4/4) ... [2024-08-14 14:30:48,675 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_rotate32.c [2024-08-14 14:30:48,675 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:30:48,696 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:30:48,697 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:30:48,731 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [9] [2024-08-14 14:30:48,734 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:30:48,788 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 91 states to 54 states. [2024-08-14 14:30:48,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:30:48,812 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;@653b9776, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:30:48,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:30:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2024-08-14 14:30:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-08-14 14:30:48,822 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:48,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:48,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:48,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2090759925, now seen corresponding path program 1 times [2024-08-14 14:30:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:30:48,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178180329] [2024-08-14 14:30:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:48,847 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:30:48,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:30:48,850 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:30:48,852 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:30:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:30:49,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:30:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:30:49,170 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:30:49,173 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:30:49,174 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:30:49,183 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:30:49,381 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:30:49,385 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:30:49,388 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:30:49,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:30:49 BoogieIcfgContainer [2024-08-14 14:30:49,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:30:49,424 INFO L158 Benchmark]: Toolchain (without parser) took 1820.83ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 44.1MB in the beginning and 46.5MB in the end (delta: -2.4MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-08-14 14:30:49,424 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 33.0MB in the beginning and 33.0MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:30:49,425 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory is still 30.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:30:49,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.58ms. Allocated memory is still 65.0MB. Free memory was 43.9MB in the beginning and 44.8MB in the end (delta: -955.1kB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-08-14 14:30:49,426 INFO L158 Benchmark]: Boogie Preprocessor took 75.35ms. Allocated memory is still 65.0MB. Free memory was 44.8MB in the beginning and 42.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:30:49,426 INFO L158 Benchmark]: IcfgBuilder took 578.16ms. Allocated memory is still 65.0MB. Free memory was 42.2MB in the beginning and 39.2MB in the end (delta: 3.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-08-14 14:30:49,427 INFO L158 Benchmark]: TraceAbstraction took 754.95ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 38.5MB in the beginning and 46.5MB in the end (delta: -8.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-08-14 14:30:49,431 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.17ms. Allocated memory is still 50.3MB. Free memory was 33.0MB in the beginning and 33.0MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory is still 30.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.58ms. Allocated memory is still 65.0MB. Free memory was 43.9MB in the beginning and 44.8MB in the end (delta: -955.1kB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.35ms. Allocated memory is still 65.0MB. Free memory was 44.8MB in the beginning and 42.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 578.16ms. Allocated memory is still 65.0MB. Free memory was 42.2MB in the beginning and 39.2MB in the end (delta: 3.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 754.95ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 38.5MB in the beginning and 46.5MB in the end (delta: -8.0MB). Peak memory consumption was 7.4MB. 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 - 5); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (5 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L35] const SORT_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 31); [L36] const SORT_22 msb_SORT_22 = (SORT_22)1 << (31 - 1); [L38] const SORT_29 mask_SORT_29 = (SORT_29)-1 >> (sizeof(SORT_29) * 8 - 30); [L39] const SORT_29 msb_SORT_29 = (SORT_29)1 << (30 - 1); [L41] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 2); [L42] const SORT_31 msb_SORT_31 = (SORT_31)1 << (2 - 1); [L44] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 28); [L45] const SORT_37 msb_SORT_37 = (SORT_37)1 << (28 - 1); [L47] const SORT_39 mask_SORT_39 = (SORT_39)-1 >> (sizeof(SORT_39) * 8 - 4); [L48] const SORT_39 msb_SORT_39 = (SORT_39)1 << (4 - 1); [L50] const SORT_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 24); [L51] const SORT_45 msb_SORT_45 = (SORT_45)1 << (24 - 1); [L53] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 8); [L54] const SORT_47 msb_SORT_47 = (SORT_47)1 << (8 - 1); [L56] const SORT_53 mask_SORT_53 = (SORT_53)-1 >> (sizeof(SORT_53) * 8 - 16); [L57] const SORT_53 msb_SORT_53 = (SORT_53)1 << (16 - 1); [L59] const SORT_5 var_7 = 0; [L60] const SORT_5 var_10 = 2863311530; [L61] const SORT_3 var_15 = 1; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L67] SORT_5 state_8 = __VERIFIER_nondet_uint() & mask_SORT_5; [L68] SORT_5 state_19 = __VERIFIER_nondet_uint() & mask_SORT_5; [L70] SORT_5 init_9_arg_1 = var_7; [L71] state_8 = init_9_arg_1 [L72] SORT_5 init_20_arg_1 = var_7; [L73] state_19 = init_20_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=0, state_8=0, var_10=-1431655766, var_15=1] [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=0, var_10=-1431655766, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(!(bad_18_arg_0)) VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=0, var_10=-1431655766, var_15=1] [L95] SORT_1 var_57_arg_0 = input_2; [L96] SORT_3 var_57 = var_57_arg_0 >> 4; [L97] var_57 = var_57 & mask_SORT_3 [L98] SORT_1 var_50_arg_0 = input_2; [L99] SORT_3 var_50 = var_50_arg_0 >> 3; [L100] var_50 = var_50 & mask_SORT_3 [L101] SORT_1 var_42_arg_0 = input_2; [L102] SORT_3 var_42 = var_42_arg_0 >> 2; [L103] var_42 = var_42 & mask_SORT_3 [L104] SORT_1 var_34_arg_0 = input_2; [L105] SORT_3 var_34 = var_34_arg_0 >> 1; [L106] var_34 = var_34 & mask_SORT_3 [L107] SORT_1 var_26_arg_0 = input_2; [L108] SORT_3 var_26 = var_26_arg_0 >> 0; [L109] var_26 = var_26 & mask_SORT_3 [L110] SORT_5 var_24_arg_0 = state_19; [L111] SORT_3 var_24 = var_24_arg_0 >> 0; [L112] SORT_5 var_23_arg_0 = state_19; [L113] SORT_22 var_23 = var_23_arg_0 >> 1; [L114] var_23 = var_23 & mask_SORT_22 [L115] SORT_3 var_25_arg_0 = var_24; [L116] SORT_22 var_25_arg_1 = var_23; [L117] SORT_5 var_25 = ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1; [L118] SORT_3 var_27_arg_0 = var_26; [L119] SORT_5 var_27_arg_1 = var_25; [L120] SORT_5 var_27_arg_2 = state_19; [L121] SORT_5 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L122] SORT_5 var_32_arg_0 = var_27; [L123] SORT_31 var_32 = var_32_arg_0 >> 0; [L124] SORT_5 var_30_arg_0 = var_27; [L125] SORT_29 var_30 = var_30_arg_0 >> 2; [L126] var_30 = var_30 & mask_SORT_29 [L127] SORT_31 var_33_arg_0 = var_32; [L128] SORT_29 var_33_arg_1 = var_30; [L129] SORT_5 var_33 = ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1; [L130] SORT_3 var_35_arg_0 = var_34; [L131] SORT_5 var_35_arg_1 = var_33; [L132] SORT_5 var_35_arg_2 = var_27; [L133] SORT_5 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L134] SORT_5 var_40_arg_0 = var_35; [L135] SORT_39 var_40 = var_40_arg_0 >> 0; [L136] SORT_5 var_38_arg_0 = var_35; [L137] SORT_37 var_38 = var_38_arg_0 >> 4; [L138] var_38 = var_38 & mask_SORT_37 [L139] SORT_39 var_41_arg_0 = var_40; [L140] SORT_37 var_41_arg_1 = var_38; [L141] SORT_5 var_41 = ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1; [L142] SORT_3 var_43_arg_0 = var_42; [L143] SORT_5 var_43_arg_1 = var_41; [L144] SORT_5 var_43_arg_2 = var_35; [L145] SORT_5 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L146] SORT_5 var_48_arg_0 = var_43; [L147] SORT_47 var_48 = var_48_arg_0 >> 0; [L148] SORT_5 var_46_arg_0 = var_43; [L149] SORT_45 var_46 = var_46_arg_0 >> 8; [L150] var_46 = var_46 & mask_SORT_45 [L151] SORT_47 var_49_arg_0 = var_48; [L152] SORT_45 var_49_arg_1 = var_46; [L153] SORT_5 var_49 = ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1; [L154] SORT_3 var_51_arg_0 = var_50; [L155] SORT_5 var_51_arg_1 = var_49; [L156] SORT_5 var_51_arg_2 = var_43; [L157] SORT_5 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L158] SORT_5 var_55_arg_0 = var_51; [L159] SORT_53 var_55 = var_55_arg_0 >> 0; [L160] SORT_5 var_54_arg_0 = var_51; [L161] SORT_53 var_54 = var_54_arg_0 >> 16; [L162] var_54 = var_54 & mask_SORT_53 [L163] SORT_53 var_56_arg_0 = var_55; [L164] SORT_53 var_56_arg_1 = var_54; [L165] SORT_5 var_56 = ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1; [L166] SORT_3 var_58_arg_0 = var_57; [L167] SORT_5 var_58_arg_1 = var_56; [L168] SORT_5 var_58_arg_2 = var_51; [L169] SORT_5 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L170] var_58 = var_58 & mask_SORT_5 [L171] SORT_5 next_60_arg_1 = var_58; [L172] SORT_5 next_61_arg_1 = input_6; [L174] state_8 = next_60_arg_1 [L175] state_19 = next_61_arg_1 [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=1431655765, var_10=-1431655766, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(!(bad_18_arg_0)) VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=1431655765, var_10=-1431655766, var_15=1] [L95] SORT_1 var_57_arg_0 = input_2; [L96] SORT_3 var_57 = var_57_arg_0 >> 4; [L97] var_57 = var_57 & mask_SORT_3 [L98] SORT_1 var_50_arg_0 = input_2; [L99] SORT_3 var_50 = var_50_arg_0 >> 3; [L100] var_50 = var_50 & mask_SORT_3 [L101] SORT_1 var_42_arg_0 = input_2; [L102] SORT_3 var_42 = var_42_arg_0 >> 2; [L103] var_42 = var_42 & mask_SORT_3 [L104] SORT_1 var_34_arg_0 = input_2; [L105] SORT_3 var_34 = var_34_arg_0 >> 1; [L106] var_34 = var_34 & mask_SORT_3 [L107] SORT_1 var_26_arg_0 = input_2; [L108] SORT_3 var_26 = var_26_arg_0 >> 0; [L109] var_26 = var_26 & mask_SORT_3 [L110] SORT_5 var_24_arg_0 = state_19; [L111] SORT_3 var_24 = var_24_arg_0 >> 0; [L112] SORT_5 var_23_arg_0 = state_19; [L113] SORT_22 var_23 = var_23_arg_0 >> 1; [L114] var_23 = var_23 & mask_SORT_22 [L115] SORT_3 var_25_arg_0 = var_24; [L116] SORT_22 var_25_arg_1 = var_23; [L117] SORT_5 var_25 = ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1; [L118] SORT_3 var_27_arg_0 = var_26; [L119] SORT_5 var_27_arg_1 = var_25; [L120] SORT_5 var_27_arg_2 = state_19; [L121] SORT_5 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L122] SORT_5 var_32_arg_0 = var_27; [L123] SORT_31 var_32 = var_32_arg_0 >> 0; [L124] SORT_5 var_30_arg_0 = var_27; [L125] SORT_29 var_30 = var_30_arg_0 >> 2; [L126] var_30 = var_30 & mask_SORT_29 [L127] SORT_31 var_33_arg_0 = var_32; [L128] SORT_29 var_33_arg_1 = var_30; [L129] SORT_5 var_33 = ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1; [L130] SORT_3 var_35_arg_0 = var_34; [L131] SORT_5 var_35_arg_1 = var_33; [L132] SORT_5 var_35_arg_2 = var_27; [L133] SORT_5 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L134] SORT_5 var_40_arg_0 = var_35; [L135] SORT_39 var_40 = var_40_arg_0 >> 0; [L136] SORT_5 var_38_arg_0 = var_35; [L137] SORT_37 var_38 = var_38_arg_0 >> 4; [L138] var_38 = var_38 & mask_SORT_37 [L139] SORT_39 var_41_arg_0 = var_40; [L140] SORT_37 var_41_arg_1 = var_38; [L141] SORT_5 var_41 = ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1; [L142] SORT_3 var_43_arg_0 = var_42; [L143] SORT_5 var_43_arg_1 = var_41; [L144] SORT_5 var_43_arg_2 = var_35; [L145] SORT_5 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L146] SORT_5 var_48_arg_0 = var_43; [L147] SORT_47 var_48 = var_48_arg_0 >> 0; [L148] SORT_5 var_46_arg_0 = var_43; [L149] SORT_45 var_46 = var_46_arg_0 >> 8; [L150] var_46 = var_46 & mask_SORT_45 [L151] SORT_47 var_49_arg_0 = var_48; [L152] SORT_45 var_49_arg_1 = var_46; [L153] SORT_5 var_49 = ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1; [L154] SORT_3 var_51_arg_0 = var_50; [L155] SORT_5 var_51_arg_1 = var_49; [L156] SORT_5 var_51_arg_2 = var_43; [L157] SORT_5 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L158] SORT_5 var_55_arg_0 = var_51; [L159] SORT_53 var_55 = var_55_arg_0 >> 0; [L160] SORT_5 var_54_arg_0 = var_51; [L161] SORT_53 var_54 = var_54_arg_0 >> 16; [L162] var_54 = var_54 & mask_SORT_53 [L163] SORT_53 var_56_arg_0 = var_55; [L164] SORT_53 var_56_arg_1 = var_54; [L165] SORT_5 var_56 = ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1; [L166] SORT_3 var_58_arg_0 = var_57; [L167] SORT_5 var_58_arg_1 = var_56; [L168] SORT_5 var_58_arg_2 = var_51; [L169] SORT_5 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L170] var_58 = var_58 & mask_SORT_5 [L171] SORT_5 next_60_arg_1 = var_58; [L172] SORT_5 next_61_arg_1 = input_6; [L174] state_8 = next_60_arg_1 [L175] state_19 = next_61_arg_1 [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=1, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=5, var_10=-1431655766, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_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: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-14 14:30:49,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE