./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount2.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.twocount2.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.twocount2.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.twocount2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:26:30,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:26:30,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-14 14:26:30,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:26:30,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:26:30,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:26:30,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:26:30,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:26:30,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:26:30,745 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:26:30,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:26:30,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:26:30,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:26:30,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:26:30,749 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:26:30,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:26:30,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:26:30,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:26:30,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:26:30,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:26:30,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:26:30,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:26:30,756 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:26:30,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:26:30,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:26:30,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:26:30,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:26:30,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:26:30,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:26:30,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:26:30,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:26:30,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:26:30,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:26:30,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:26:30,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:26:30,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:26:30,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:26:30,761 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:26:30,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:26:30,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:26:30,762 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:26:31,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:26:31,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:26:31,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:26:31,046 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:26:31,046 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:26:31,047 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.twocount2.yml/witness.yml [2024-08-14 14:26:31,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:26:31,128 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:26:31,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-08-14 14:26:32,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:26:32,674 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:26:32,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-08-14 14:26:32,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd160b98/ec8509b2b27242a18618dc4c5a921729/FLAG22bd62a54 [2024-08-14 14:26:32,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd160b98/ec8509b2b27242a18618dc4c5a921729 [2024-08-14 14:26:32,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:26:32,695 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:26:32,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:26:32,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:26:32,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:26:32,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:31" (1/2) ... [2024-08-14 14:26:32,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c1a0396 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:32, skipping insertion in model container [2024-08-14 14:26:32,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:31" (1/2) ... [2024-08-14 14:26:32,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6dbc543e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:32, skipping insertion in model container [2024-08-14 14:26:32,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:26:32" (2/2) ... [2024-08-14 14:26:32,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c1a0396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:32, skipping insertion in model container [2024-08-14 14:26:32,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:26:32" (2/2) ... [2024-08-14 14:26:32,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:26:32,922 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.twocount2.c[1259,1272] [2024-08-14 14:26:33,006 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:26:33,029 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:26:33,042 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.twocount2.c[1259,1272] [2024-08-14 14:26:33,068 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:26:33,085 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:26:33,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33 WrapperNode [2024-08-14 14:26:33,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:26:33,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:26:33,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:26:33,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:26:33,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33" (1/1) ... [2024-08-14 14:26:33,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33" (1/1) ... [2024-08-14 14:26:33,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33" (1/1) ... [2024-08-14 14:26:33,145 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:26:33,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33" (1/1) ... [2024-08-14 14:26:33,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33" (1/1) ... [2024-08-14 14:26:33,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33" (1/1) ... [2024-08-14 14:26:33,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33" (1/1) ... [2024-08-14 14:26:33,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33" (1/1) ... [2024-08-14 14:26:33,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:26:33,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:26:33,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:26:33,159 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:26:33,159 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33" (1/1) ... [2024-08-14 14:26:33,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:26:33,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:33,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:26:33,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:26:33,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:26:33,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:26:33,253 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:26:33,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:26:33,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:26:33,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:26:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:26:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:26:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:26:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:26:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:26:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:26:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:26:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:26:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:26:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:26:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:26:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:26:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:26:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:26:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:26:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:26:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:26:33,338 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:26:33,342 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:26:33,710 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-08-14 14:26:33,710 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:26:33,723 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:26:33,724 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:26:33,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:26:33 BoogieIcfgContainer [2024-08-14 14:26:33,724 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:26:33,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:26:33,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:26:33,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:26:33,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:31" (1/4) ... [2024-08-14 14:26:33,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157d3d23 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:26:33, skipping insertion in model container [2024-08-14 14:26:33,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:26:32" (2/4) ... [2024-08-14 14:26:33,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157d3d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:26:33, skipping insertion in model container [2024-08-14 14:26:33,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:33" (3/4) ... [2024-08-14 14:26:33,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157d3d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:26:33, skipping insertion in model container [2024-08-14 14:26:33,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:26:33" (4/4) ... [2024-08-14 14:26:33,735 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2024-08-14 14:26:33,735 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:26:33,758 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:26:33,758 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:26:33,786 INFO L92 WitnessUtils]: Constructing product of automaton with 45 states and violation witness of the following lengths: [21] [2024-08-14 14:26:33,790 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 45 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:33,913 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 458 states to 377 states. [2024-08-14 14:26:33,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:26:33,937 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;@3e7c598b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:26:33,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:26:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states. [2024-08-14 14:26:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-08-14 14:26:33,955 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:33,956 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:33,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:33,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash 804909074, now seen corresponding path program 1 times [2024-08-14 14:26:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:33,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769014888] [2024-08-14 14:26:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-08-14 14:26:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-08-14 14:26:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-08-14 14:26:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:26:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-08-14 14:26:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2024-08-14 14:26:35,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:35,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769014888] [2024-08-14 14:26:35,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769014888] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:35,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:35,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:26:35,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811131860] [2024-08-14 14:26:35,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:35,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:26:35,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:35,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:26:35,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:26:35,367 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:35,453 INFO L93 Difference]: Finished difference Result 320 states and 458 transitions. [2024-08-14 14:26:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:26:35,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 135 [2024-08-14 14:26:35,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:35,462 INFO L225 Difference]: With dead ends: 320 [2024-08-14 14:26:35,463 INFO L226 Difference]: Without dead ends: 314 [2024-08-14 14:26:35,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:26:35,469 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:35,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 251 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:26:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-08-14 14:26:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 179. [2024-08-14 14:26:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 161 states have (on average 1.515527950310559) internal successors, (244), 162 states have internal predecessors, (244), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-08-14 14:26:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 261 transitions. [2024-08-14 14:26:35,525 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 261 transitions. Word has length 135 [2024-08-14 14:26:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:35,529 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 261 transitions. [2024-08-14 14:26:35,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 261 transitions. [2024-08-14 14:26:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-08-14 14:26:35,532 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:35,532 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:35,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:26:35,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:35,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:35,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1864344097, now seen corresponding path program 1 times [2024-08-14 14:26:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127275965] [2024-08-14 14:26:35,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-08-14 14:26:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-08-14 14:26:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-08-14 14:26:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:26:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-08-14 14:26:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-08-14 14:26:36,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:36,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127275965] [2024-08-14 14:26:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127275965] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:26:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260853572] [2024-08-14 14:26:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:36,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:26:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:36,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:26:36,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:26:36,067 INFO L87 Difference]: Start difference. First operand 179 states and 261 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:36,099 INFO L93 Difference]: Finished difference Result 193 states and 275 transitions. [2024-08-14 14:26:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:26:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 136 [2024-08-14 14:26:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:36,101 INFO L225 Difference]: With dead ends: 193 [2024-08-14 14:26:36,102 INFO L226 Difference]: Without dead ends: 193 [2024-08-14 14:26:36,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:26:36,103 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:36,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:26:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-08-14 14:26:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-08-14 14:26:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 173 states have (on average 1.4797687861271676) internal successors, (256), 174 states have internal predecessors, (256), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-08-14 14:26:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2024-08-14 14:26:36,127 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 136 [2024-08-14 14:26:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:36,128 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2024-08-14 14:26:36,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2024-08-14 14:26:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-08-14 14:26:36,133 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:36,133 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:36,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:26:36,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:36,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -514538512, now seen corresponding path program 1 times [2024-08-14 14:26:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291350293] [2024-08-14 14:26:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:36,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-08-14 14:26:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-08-14 14:26:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-08-14 14:26:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:26:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-08-14 14:26:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-08-14 14:26:36,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:36,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291350293] [2024-08-14 14:26:36,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291350293] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:36,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069939690] [2024-08-14 14:26:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:36,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:36,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:36,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:36,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-14 14:26:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:37,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 23 conjunts are in the unsatisfiable core [2024-08-14 14:26:37,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-08-14 14:26:37,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:26:37,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069939690] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:37,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:26:37,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-08-14 14:26:37,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554002746] [2024-08-14 14:26:37,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:37,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:26:37,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:37,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:26:37,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-08-14 14:26:37,384 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:26:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:37,436 INFO L93 Difference]: Finished difference Result 191 states and 266 transitions. [2024-08-14 14:26:37,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:26:37,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 137 [2024-08-14 14:26:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:37,438 INFO L225 Difference]: With dead ends: 191 [2024-08-14 14:26:37,439 INFO L226 Difference]: Without dead ends: 191 [2024-08-14 14:26:37,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-08-14 14:26:37,440 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:37,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 109 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:26:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-08-14 14:26:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-08-14 14:26:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 173 states have (on average 1.439306358381503) internal successors, (249), 174 states have internal predecessors, (249), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-08-14 14:26:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 266 transitions. [2024-08-14 14:26:37,449 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 266 transitions. Word has length 137 [2024-08-14 14:26:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:37,450 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 266 transitions. [2024-08-14 14:26:37,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:26:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 266 transitions. [2024-08-14 14:26:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-08-14 14:26:37,452 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:37,452 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:37,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-08-14 14:26:37,656 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:26:37,658 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:37,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1292915951, now seen corresponding path program 1 times [2024-08-14 14:26:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:37,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677498779] [2024-08-14 14:26:37,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-08-14 14:26:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-08-14 14:26:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-08-14 14:26:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:26:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-08-14 14:26:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-08-14 14:26:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677498779] [2024-08-14 14:26:38,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677498779] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:38,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733416918] [2024-08-14 14:26:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:38,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:38,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:38,139 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:38,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-14 14:26:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:38,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-14 14:26:38,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 113 proven. 44 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-08-14 14:26:38,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 113 proven. 44 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-08-14 14:26:38,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733416918] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:38,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:38,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-08-14 14:26:38,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513422136] [2024-08-14 14:26:38,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:38,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 14:26:38,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:38,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 14:26:38,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-08-14 14:26:38,857 INFO L87 Difference]: Start difference. First operand 191 states and 266 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-08-14 14:26:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:39,007 INFO L93 Difference]: Finished difference Result 504 states and 710 transitions. [2024-08-14 14:26:39,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 14:26:39,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 137 [2024-08-14 14:26:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:39,010 INFO L225 Difference]: With dead ends: 504 [2024-08-14 14:26:39,010 INFO L226 Difference]: Without dead ends: 393 [2024-08-14 14:26:39,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:26:39,012 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 24 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:39,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 423 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:26:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-08-14 14:26:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 289. [2024-08-14 14:26:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 264 states have (on average 1.4128787878787878) internal successors, (373), 266 states have internal predecessors, (373), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-08-14 14:26:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 404 transitions. [2024-08-14 14:26:39,027 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 404 transitions. Word has length 137 [2024-08-14 14:26:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:39,027 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 404 transitions. [2024-08-14 14:26:39,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-08-14 14:26:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 404 transitions. [2024-08-14 14:26:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-08-14 14:26:39,030 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:39,030 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:39,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-14 14:26:39,230 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:26:39,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:39,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:39,232 INFO L85 PathProgramCache]: Analyzing trace with hash -518844725, now seen corresponding path program 1 times [2024-08-14 14:26:39,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:39,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991220991] [2024-08-14 14:26:39,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:39,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:39,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:39,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:39,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:26:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:39,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-08-14 14:26:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-08-14 14:26:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:39,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-14 14:26:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:39,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:26:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-08-14 14:26:39,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:39,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991220991] [2024-08-14 14:26:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991220991] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:39,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:39,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:26:39,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898589634] [2024-08-14 14:26:39,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:39,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:26:39,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:26:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:26:39,838 INFO L87 Difference]: Start difference. First operand 289 states and 404 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 4 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:26:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:39,915 INFO L93 Difference]: Finished difference Result 393 states and 548 transitions. [2024-08-14 14:26:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:26:39,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 4 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 143 [2024-08-14 14:26:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:39,918 INFO L225 Difference]: With dead ends: 393 [2024-08-14 14:26:39,918 INFO L226 Difference]: Without dead ends: 393 [2024-08-14 14:26:39,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:26:39,919 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 39 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:39,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 148 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:26:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-08-14 14:26:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-08-14 14:26:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 361 states have (on average 1.3933518005540166) internal successors, (503), 364 states have internal predecessors, (503), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-08-14 14:26:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 548 transitions. [2024-08-14 14:26:39,940 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 548 transitions. Word has length 143 [2024-08-14 14:26:39,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:39,941 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 548 transitions. [2024-08-14 14:26:39,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 4 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:26:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 548 transitions. [2024-08-14 14:26:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-08-14 14:26:39,943 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:39,943 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:39,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 14:26:39,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:39,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:39,945 INFO L85 PathProgramCache]: Analyzing trace with hash -399727279, now seen corresponding path program 1 times [2024-08-14 14:26:39,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:39,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235314111] [2024-08-14 14:26:39,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:26:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-08-14 14:26:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-08-14 14:26:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-14 14:26:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:26:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 24 proven. 41 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-08-14 14:26:40,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:40,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235314111] [2024-08-14 14:26:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235314111] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018770337] [2024-08-14 14:26:40,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:40,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:40,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:40,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:40,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-14 14:26:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:41,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 37 conjunts are in the unsatisfiable core [2024-08-14 14:26:41,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 52 proven. 89 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-08-14 14:26:41,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 99 proven. 30 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-08-14 14:26:41,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018770337] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:41,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:41,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-08-14 14:26:41,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600582625] [2024-08-14 14:26:41,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:41,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-14 14:26:41,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:41,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-14 14:26:41,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-08-14 14:26:41,806 INFO L87 Difference]: Start difference. First operand 393 states and 548 transitions. Second operand has 17 states, 17 states have (on average 6.823529411764706) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-08-14 14:26:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:42,318 INFO L93 Difference]: Finished difference Result 603 states and 825 transitions. [2024-08-14 14:26:42,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 14:26:42,319 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.823529411764706) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 143 [2024-08-14 14:26:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:42,324 INFO L225 Difference]: With dead ends: 603 [2024-08-14 14:26:42,326 INFO L226 Difference]: Without dead ends: 603 [2024-08-14 14:26:42,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2024-08-14 14:26:42,327 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 90 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:42,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 254 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:26:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-08-14 14:26:42,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 443. [2024-08-14 14:26:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 411 states have (on average 1.3698296836982968) internal successors, (563), 414 states have internal predecessors, (563), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-08-14 14:26:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 608 transitions. [2024-08-14 14:26:42,350 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 608 transitions. Word has length 143 [2024-08-14 14:26:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:42,350 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 608 transitions. [2024-08-14 14:26:42,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.823529411764706) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-08-14 14:26:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 608 transitions. [2024-08-14 14:26:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-08-14 14:26:42,353 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:42,353 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:42,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-08-14 14:26:42,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:42,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:42,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:42,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1957688067, now seen corresponding path program 1 times [2024-08-14 14:26:42,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:42,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344635893] [2024-08-14 14:26:42,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:42,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:43,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:43,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:26:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-08-14 14:26:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-08-14 14:26:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-14 14:26:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:26:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 49 proven. 41 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-08-14 14:26:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344635893] [2024-08-14 14:26:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344635893] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826972876] [2024-08-14 14:26:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:43,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:43,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:43,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:43,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-14 14:26:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:43,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 53 conjunts are in the unsatisfiable core [2024-08-14 14:26:43,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 77 proven. 99 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-08-14 14:26:44,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 95 proven. 57 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-08-14 14:26:44,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826972876] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:44,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:44,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 23 [2024-08-14 14:26:44,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476828974] [2024-08-14 14:26:44,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:44,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-14 14:26:44,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:44,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-14 14:26:44,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-08-14 14:26:44,545 INFO L87 Difference]: Start difference. First operand 443 states and 608 transitions. Second operand has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-08-14 14:26:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:45,509 INFO L93 Difference]: Finished difference Result 964 states and 1270 transitions. [2024-08-14 14:26:45,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 14:26:45,510 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 144 [2024-08-14 14:26:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:45,515 INFO L225 Difference]: With dead ends: 964 [2024-08-14 14:26:45,515 INFO L226 Difference]: Without dead ends: 964 [2024-08-14 14:26:45,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2024-08-14 14:26:45,517 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 126 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:45,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 309 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-14 14:26:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-08-14 14:26:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 498. [2024-08-14 14:26:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 466 states have (on average 1.3690987124463518) internal successors, (638), 469 states have internal predecessors, (638), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-08-14 14:26:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 683 transitions. [2024-08-14 14:26:45,539 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 683 transitions. Word has length 144 [2024-08-14 14:26:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:45,540 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 683 transitions. [2024-08-14 14:26:45,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-08-14 14:26:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 683 transitions. [2024-08-14 14:26:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-08-14 14:26:45,542 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:45,542 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:45,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-14 14:26:45,746 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:26:45,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:45,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1754049265, now seen corresponding path program 1 times [2024-08-14 14:26:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:45,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784398009] [2024-08-14 14:26:45,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:46,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:26:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-08-14 14:26:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-08-14 14:26:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:46,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-14 14:26:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:46,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:26:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 159 proven. 5 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-08-14 14:26:46,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:46,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784398009] [2024-08-14 14:26:46,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784398009] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:46,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767298272] [2024-08-14 14:26:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:46,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:46,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:46,701 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:46,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-14 14:26:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:46,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 32 conjunts are in the unsatisfiable core [2024-08-14 14:26:46,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 129 proven. 119 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-08-14 14:26:47,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 90 proven. 158 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-08-14 14:26:47,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767298272] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:47,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:47,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2024-08-14 14:26:47,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326301700] [2024-08-14 14:26:47,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:47,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-08-14 14:26:47,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:47,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-08-14 14:26:47,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-08-14 14:26:47,861 INFO L87 Difference]: Start difference. First operand 498 states and 683 transitions. Second operand has 25 states, 25 states have (on average 6.64) internal successors, (166), 25 states have internal predecessors, (166), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-08-14 14:26:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:48,711 INFO L93 Difference]: Finished difference Result 641 states and 856 transitions. [2024-08-14 14:26:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 14:26:48,712 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.64) internal successors, (166), 25 states have internal predecessors, (166), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 145 [2024-08-14 14:26:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:48,715 INFO L225 Difference]: With dead ends: 641 [2024-08-14 14:26:48,715 INFO L226 Difference]: Without dead ends: 641 [2024-08-14 14:26:48,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=1329, Unknown=0, NotChecked=0, Total=1560 [2024-08-14 14:26:48,716 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 131 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:48,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 397 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-14 14:26:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-08-14 14:26:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2024-08-14 14:26:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 594 states have (on average 1.3148148148148149) internal successors, (781), 597 states have internal predecessors, (781), 38 states have call successors, (38), 9 states have call predecessors, (38), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-08-14 14:26:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 856 transitions. [2024-08-14 14:26:48,733 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 856 transitions. Word has length 145 [2024-08-14 14:26:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:48,733 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 856 transitions. [2024-08-14 14:26:48,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.64) internal successors, (166), 25 states have internal predecessors, (166), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-08-14 14:26:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 856 transitions. [2024-08-14 14:26:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-08-14 14:26:48,736 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:48,736 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:48,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-08-14 14:26:48,937 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:26:48,937 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:48,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1641596748, now seen corresponding path program 1 times [2024-08-14 14:26:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167901205] [2024-08-14 14:26:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:49,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:49,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:26:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:49,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:26:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-08-14 14:26:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:49,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-08-14 14:26:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:26:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-08-14 14:26:49,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:49,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167901205] [2024-08-14 14:26:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167901205] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:49,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:49,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:26:49,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819553360] [2024-08-14 14:26:49,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:49,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:26:49,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:26:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:26:49,405 INFO L87 Difference]: Start difference. First operand 641 states and 856 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 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:26:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:49,456 INFO L93 Difference]: Finished difference Result 641 states and 834 transitions. [2024-08-14 14:26:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:26:49,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 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 145 [2024-08-14 14:26:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:49,458 INFO L225 Difference]: With dead ends: 641 [2024-08-14 14:26:49,459 INFO L226 Difference]: Without dead ends: 641 [2024-08-14 14:26:49,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:26:49,461 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 27 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:49,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 117 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:26:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-08-14 14:26:49,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 434. [2024-08-14 14:26:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 400 states have (on average 1.2925) internal successors, (517), 402 states have internal predecessors, (517), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-08-14 14:26:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 566 transitions. [2024-08-14 14:26:49,474 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 566 transitions. Word has length 145 [2024-08-14 14:26:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:49,474 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 566 transitions. [2024-08-14 14:26:49,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 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:26:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 566 transitions. [2024-08-14 14:26:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-08-14 14:26:49,476 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:49,476 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:49,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-14 14:26:49,476 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:49,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -966081500, now seen corresponding path program 1 times [2024-08-14 14:26:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:49,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994978698] [2024-08-14 14:26:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:50,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:50,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:26:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:50,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:26:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-14 14:26:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:50,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-08-14 14:26:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-08-14 14:26:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 159 proven. 9 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-08-14 14:26:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994978698] [2024-08-14 14:26:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994978698] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877512532] [2024-08-14 14:26:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:50,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:50,235 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:26:50,237 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:26:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:50,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 26 conjunts are in the unsatisfiable core [2024-08-14 14:26:50,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 128 proven. 20 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-08-14 14:26:50,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 65 proven. 83 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-08-14 14:26:51,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877512532] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:51,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:51,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2024-08-14 14:26:51,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15087944] [2024-08-14 14:26:51,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:51,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-08-14 14:26:51,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:51,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-08-14 14:26:51,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-08-14 14:26:51,699 INFO L87 Difference]: Start difference. First operand 434 states and 566 transitions. Second operand has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 19 states have internal predecessors, (146), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-14 14:26:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:52,595 INFO L93 Difference]: Finished difference Result 1402 states and 1824 transitions. [2024-08-14 14:26:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-14 14:26:52,595 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 19 states have internal predecessors, (146), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 149 [2024-08-14 14:26:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:52,602 INFO L225 Difference]: With dead ends: 1402 [2024-08-14 14:26:52,602 INFO L226 Difference]: Without dead ends: 1402 [2024-08-14 14:26:52,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=322, Invalid=1840, Unknown=0, NotChecked=0, Total=2162 [2024-08-14 14:26:52,604 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:52,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 772 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:26:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2024-08-14 14:26:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1128. [2024-08-14 14:26:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1054 states have (on average 1.2732447817836812) internal successors, (1342), 1060 states have internal predecessors, (1342), 65 states have call successors, (65), 9 states have call predecessors, (65), 8 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-08-14 14:26:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1471 transitions. [2024-08-14 14:26:52,632 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1471 transitions. Word has length 149 [2024-08-14 14:26:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:52,632 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 1471 transitions. [2024-08-14 14:26:52,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 19 states have internal predecessors, (146), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-14 14:26:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1471 transitions. [2024-08-14 14:26:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-08-14 14:26:52,635 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:52,636 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:52,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-08-14 14:26:52,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:52,837 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:52,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash 544122919, now seen corresponding path program 1 times [2024-08-14 14:26:52,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:52,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105111780] [2024-08-14 14:26:52,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:52,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:53,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:53,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:53,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:26:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:53,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:26:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-14 14:26:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:53,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-08-14 14:26:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-08-14 14:26:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 138 proven. 10 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-08-14 14:26:53,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105111780] [2024-08-14 14:26:53,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105111780] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46766124] [2024-08-14 14:26:53,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:53,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:53,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:53,643 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:26:53,644 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:26:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:53,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 30 conjunts are in the unsatisfiable core [2024-08-14 14:26:53,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 162 proven. 10 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-08-14 14:26:54,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 138 proven. 10 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-08-14 14:26:54,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46766124] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:54,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:54,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-08-14 14:26:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498267735] [2024-08-14 14:26:54,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:54,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-14 14:26:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:54,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-14 14:26:54,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-08-14 14:26:54,326 INFO L87 Difference]: Start difference. First operand 1128 states and 1471 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-08-14 14:26:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:54,453 INFO L93 Difference]: Finished difference Result 1266 states and 1630 transitions. [2024-08-14 14:26:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 14:26:54,457 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 149 [2024-08-14 14:26:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:54,462 INFO L225 Difference]: With dead ends: 1266 [2024-08-14 14:26:54,462 INFO L226 Difference]: Without dead ends: 1141 [2024-08-14 14:26:54,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 305 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-08-14 14:26:54,463 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 58 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:54,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 353 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:26:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2024-08-14 14:26:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1140. [2024-08-14 14:26:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1065 states have (on average 1.2732394366197184) internal successors, (1356), 1071 states have internal predecessors, (1356), 66 states have call successors, (66), 9 states have call predecessors, (66), 8 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2024-08-14 14:26:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1487 transitions. [2024-08-14 14:26:54,488 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1487 transitions. Word has length 149 [2024-08-14 14:26:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:54,488 INFO L495 AbstractCegarLoop]: Abstraction has 1140 states and 1487 transitions. [2024-08-14 14:26:54,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-08-14 14:26:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1487 transitions. [2024-08-14 14:26:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-08-14 14:26:54,491 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:54,492 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:54,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-08-14 14:26:54,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:54,692 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:54,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1849682921, now seen corresponding path program 1 times [2024-08-14 14:26:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:54,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919690657] [2024-08-14 14:26:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:26:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-08-14 14:26:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-08-14 14:26:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-08-14 14:26:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-08-14 14:26:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-08-14 14:26:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919690657] [2024-08-14 14:26:55,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919690657] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:55,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:55,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 14:26:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364618377] [2024-08-14 14:26:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:55,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:26:55,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:55,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:26:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:26:55,477 INFO L87 Difference]: Start difference. First operand 1140 states and 1487 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:55,556 INFO L93 Difference]: Finished difference Result 1122 states and 1461 transitions. [2024-08-14 14:26:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:26:55,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 150 [2024-08-14 14:26:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:55,560 INFO L225 Difference]: With dead ends: 1122 [2024-08-14 14:26:55,560 INFO L226 Difference]: Without dead ends: 1122 [2024-08-14 14:26:55,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:26:55,561 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 29 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:55,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 147 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:26:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-08-14 14:26:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2024-08-14 14:26:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1047 states have (on average 1.2702960840496658) internal successors, (1330), 1053 states have internal predecessors, (1330), 66 states have call successors, (66), 9 states have call predecessors, (66), 8 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2024-08-14 14:26:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1461 transitions. [2024-08-14 14:26:55,584 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1461 transitions. Word has length 150 [2024-08-14 14:26:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:55,584 INFO L495 AbstractCegarLoop]: Abstraction has 1122 states and 1461 transitions. [2024-08-14 14:26:55,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1461 transitions. [2024-08-14 14:26:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-08-14 14:26:55,588 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:55,588 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:55,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-14 14:26:55,589 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:55,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1389995453, now seen corresponding path program 2 times [2024-08-14 14:26:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:55,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106506595] [2024-08-14 14:26:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:55,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:56,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:56,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:26:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-08-14 14:26:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:56,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-08-14 14:26:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:56,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-08-14 14:26:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-08-14 14:26:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 100 proven. 49 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-08-14 14:26:56,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:56,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106506595] [2024-08-14 14:26:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106506595] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:56,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456529821] [2024-08-14 14:26:56,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:26:56,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:56,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:56,998 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:26:57,000 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:26:57,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:26:57,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:26:57,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 171 conjunts are in the unsatisfiable core [2024-08-14 14:26:57,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-08-14 14:26:59,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:27:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 159 proven. 10 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-08-14 14:27:00,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456529821] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:27:00,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:27:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 27, 17] total 51 [2024-08-14 14:27:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590115065] [2024-08-14 14:27:00,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:27:00,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-08-14 14:27:00,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-08-14 14:27:00,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2230, Unknown=0, NotChecked=0, Total=2550 [2024-08-14 14:27:00,929 INFO L87 Difference]: Start difference. First operand 1122 states and 1461 transitions. Second operand has 51 states, 51 states have (on average 3.764705882352941) internal successors, (192), 51 states have internal predecessors, (192), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-08-14 14:27:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:06,864 INFO L93 Difference]: Finished difference Result 1583 states and 2000 transitions. [2024-08-14 14:27:06,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-08-14 14:27:06,865 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.764705882352941) internal successors, (192), 51 states have internal predecessors, (192), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 150 [2024-08-14 14:27:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:06,871 INFO L225 Difference]: With dead ends: 1583 [2024-08-14 14:27:06,871 INFO L226 Difference]: Without dead ends: 1583 [2024-08-14 14:27:06,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4650 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1719, Invalid=13781, Unknown=0, NotChecked=0, Total=15500 [2024-08-14 14:27:06,876 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 421 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:06,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 627 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-08-14 14:27:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-08-14 14:27:06,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1028. [2024-08-14 14:27:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 956 states have (on average 1.2489539748953975) internal successors, (1194), 967 states have internal predecessors, (1194), 63 states have call successors, (63), 9 states have call predecessors, (63), 8 states have return successors, (62), 51 states have call predecessors, (62), 62 states have call successors, (62) [2024-08-14 14:27:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1319 transitions. [2024-08-14 14:27:06,911 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1319 transitions. Word has length 150 [2024-08-14 14:27:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:06,911 INFO L495 AbstractCegarLoop]: Abstraction has 1028 states and 1319 transitions. [2024-08-14 14:27:06,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.764705882352941) internal successors, (192), 51 states have internal predecessors, (192), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-08-14 14:27:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1319 transitions. [2024-08-14 14:27:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-08-14 14:27:06,914 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:06,915 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:06,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-08-14 14:27:07,115 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,SelfDestructingSolverStorable12 [2024-08-14 14:27:07,115 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:07,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:07,116 INFO L85 PathProgramCache]: Analyzing trace with hash 531088920, now seen corresponding path program 1 times [2024-08-14 14:27:07,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:07,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917135186] [2024-08-14 14:27:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:27:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:08,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:27:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:08,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-08-14 14:27:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-08-14 14:27:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:08,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-08-14 14:27:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:08,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-08-14 14:27:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 146 proven. 11 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-08-14 14:27:08,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917135186] [2024-08-14 14:27:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917135186] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:27:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354475079] [2024-08-14 14:27:08,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:08,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:27:08,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:08,666 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:27:08,667 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:27:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:09,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 200 conjunts are in the unsatisfiable core [2024-08-14 14:27:09,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:27:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 170 proven. 11 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-08-14 14:27:09,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:27:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 113 proven. 154 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-08-14 14:27:13,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354475079] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:27:13,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:27:13,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 32] total 56 [2024-08-14 14:27:13,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868778259] [2024-08-14 14:27:13,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:27:13,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-08-14 14:27:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-08-14 14:27:13,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2024-08-14 14:27:13,551 INFO L87 Difference]: Start difference. First operand 1028 states and 1319 transitions. Second operand has 56 states, 55 states have (on average 3.309090909090909) internal successors, (182), 55 states have internal predecessors, (182), 11 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-08-14 14:27:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:23,505 INFO L93 Difference]: Finished difference Result 2883 states and 3721 transitions. [2024-08-14 14:27:23,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-08-14 14:27:23,506 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 3.309090909090909) internal successors, (182), 55 states have internal predecessors, (182), 11 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 152 [2024-08-14 14:27:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:23,515 INFO L225 Difference]: With dead ends: 2883 [2024-08-14 14:27:23,516 INFO L226 Difference]: Without dead ends: 2883 [2024-08-14 14:27:23,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9415 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3064, Invalid=25666, Unknown=0, NotChecked=0, Total=28730 [2024-08-14 14:27:23,523 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 842 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:23,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 584 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-08-14 14:27:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2024-08-14 14:27:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2217. [2024-08-14 14:27:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 2036 states have (on average 1.2554027504911591) internal successors, (2556), 2093 states have internal predecessors, (2556), 165 states have call successors, (165), 16 states have call predecessors, (165), 15 states have return successors, (164), 107 states have call predecessors, (164), 164 states have call successors, (164) [2024-08-14 14:27:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 2885 transitions. [2024-08-14 14:27:23,571 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 2885 transitions. Word has length 152 [2024-08-14 14:27:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:23,572 INFO L495 AbstractCegarLoop]: Abstraction has 2217 states and 2885 transitions. [2024-08-14 14:27:23,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 3.309090909090909) internal successors, (182), 55 states have internal predecessors, (182), 11 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-08-14 14:27:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2885 transitions. [2024-08-14 14:27:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-08-14 14:27:23,578 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:23,578 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:23,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-08-14 14:27:23,778 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,SelfDestructingSolverStorable13 [2024-08-14 14:27:23,779 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:23,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1891079941, now seen corresponding path program 2 times [2024-08-14 14:27:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:23,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208554485] [2024-08-14 14:27:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:24,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:27:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:24,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:27:24,419 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:27:24,420 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:27:24,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-14 14:27:24,425 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:24,428 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:27:24,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:27:24 BoogieIcfgContainer [2024-08-14 14:27:24,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:27:24,501 INFO L158 Benchmark]: Toolchain (without parser) took 51804.27ms. Allocated memory was 190.8MB in the beginning and 926.9MB in the end (delta: 736.1MB). Free memory was 131.2MB in the beginning and 557.1MB in the end (delta: -425.8MB). Peak memory consumption was 308.7MB. Max. memory is 16.1GB. [2024-08-14 14:27:24,501 INFO L158 Benchmark]: Witness Parser took 0.31ms. Allocated memory is still 100.7MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:24,503 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:24,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.44ms. Allocated memory is still 190.8MB. Free memory was 130.8MB in the beginning and 156.1MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:27:24,503 INFO L158 Benchmark]: Boogie Preprocessor took 69.95ms. Allocated memory is still 190.8MB. Free memory was 156.1MB in the beginning and 152.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:27:24,504 INFO L158 Benchmark]: IcfgBuilder took 566.76ms. Allocated memory is still 190.8MB. Free memory was 152.9MB in the beginning and 128.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-08-14 14:27:24,504 INFO L158 Benchmark]: TraceAbstraction took 50771.38ms. Allocated memory was 190.8MB in the beginning and 926.9MB in the end (delta: 736.1MB). Free memory was 127.8MB in the beginning and 557.1MB in the end (delta: -429.3MB). Peak memory consumption was 308.9MB. Max. memory is 16.1GB. [2024-08-14 14:27:24,505 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.31ms. Allocated memory is still 100.7MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.44ms. Allocated memory is still 190.8MB. Free memory was 130.8MB in the beginning and 156.1MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.95ms. Allocated memory is still 190.8MB. Free memory was 156.1MB in the beginning and 152.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 566.76ms. Allocated memory is still 190.8MB. Free memory was 152.9MB in the beginning and 128.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50771.38ms. Allocated memory was 190.8MB in the beginning and 926.9MB in the end (delta: 736.1MB). Free memory was 127.8MB in the beginning and 557.1MB in the end (delta: -429.3MB). Peak memory consumption was 308.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 22]: 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 78. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 2); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = mask_SORT_2; [L37] SORT_1 input_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=3, var_16=3, var_4=0, var_9=1] [L39] SORT_2 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=3, var_16=3, var_4=0, var_9=1] [L40] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L42] SORT_2 init_7_arg_1 = var_4; [L43] state_5 = init_7_arg_1 [L44] SORT_2 init_8_arg_1 = var_4; [L45] state_6 = init_8_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_12=1, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_12=1, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=1, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=1, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=1, state_6=0, var_11=1, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=1, var_13=0, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=1, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=0, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=0, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=0, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=0, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_12=2, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_12=2, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, state_6=0, var_11=1, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, var_13=0, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=0, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=0, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=0, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=0, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_12=3, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_12=3, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=0, var_11=1, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, var_13=0, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=0, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=0, var_16=3, var_19_arg_0=1, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=0, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=0, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_12=4, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_12=4, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, state_6=0, var_11=1, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, var_13=1, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, var_13=1, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=1, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=1, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=1, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=1, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=1, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=1, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=1, var_12=3, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=1, var_12=3, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=1, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=1, var_11=2, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=1, var_11=2, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=1, var_11=2, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, var_13=2, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, var_13=2, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=2, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=2, var_16=3, var_19_arg_0=1, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=2, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=2, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=2, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=2, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=2, var_12=4, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=2, var_12=4, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=2, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=2, var_11=3, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=2, var_11=3, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=2, var_11=3, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, var_13=3, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, var_13=3, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_19_arg_0=1, var_19_arg_1=1, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_19_arg_0=1, var_19_arg_1=1, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_19=1, var_9=1] [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=1, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=0] [L22] COND TRUE !(cond) VAL [\old(cond)=0] [L22] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.6s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1936 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1929 mSDsluCounter, 4643 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4054 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7959 IncrementalHoareTripleChecker+Invalid, 8213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 589 mSDtfsCounter, 7959 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3067 GetRequests, 2574 SyntacticMatches, 4 SemanticMatches, 489 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15219 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2217occurred in iteration=14, InterpolantAutomatonStates: 365, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 2570 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 3473 NumberOfCodeBlocks, 3473 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4459 ConstructedInterpolants, 0 QuantifiedInterpolants, 27976 SizeOfPredicates, 48 NumberOfNonLiveVariables, 6108 ConjunctsInSsa, 580 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 9881/11221 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:27:24,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount2.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.twocount2.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:27:26,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:27:26,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-14 14:27:26,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:27:26,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:27:26,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:27:26,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:27:26,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:27:26,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:27:26,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:27:26,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:27:26,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:27:26,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:27:26,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:27:26,858 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:27:26,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:27:26,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:27:26,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:27:26,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:27:26,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:27:26,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:27:26,861 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:27:26,862 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:27:26,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:27:26,862 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:27:26,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:27:26,863 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:27:26,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:27:26,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:27:26,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:27:26,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:27:26,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:27:26,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:27:26,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:27:26,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:27:26,866 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:27:26,867 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:27:26,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:27:26,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:27:26,868 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:27:26,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:27:26,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:27:26,869 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:27:26,869 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:27:27,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:27:27,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:27:27,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:27:27,245 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:27:27,246 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:27:27,248 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.twocount2.yml/witness.yml [2024-08-14 14:27:27,333 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:27:27,333 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:27:27,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-08-14 14:27:28,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:27:29,184 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:27:29,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-08-14 14:27:29,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5baa7422b/6169ec3ff423424e86f79dce850b79d7/FLAG7728c6664 [2024-08-14 14:27:29,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5baa7422b/6169ec3ff423424e86f79dce850b79d7 [2024-08-14 14:27:29,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:27:29,580 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:27:29,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:27:29,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:27:29,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:27:29,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:27" (1/2) ... [2024-08-14 14:27:29,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c43e017 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:29, skipping insertion in model container [2024-08-14 14:27:29,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:27" (1/2) ... [2024-08-14 14:27:29,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@464f5f49 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:29, skipping insertion in model container [2024-08-14 14:27:29,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:27:29" (2/2) ... [2024-08-14 14:27:29,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c43e017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29, skipping insertion in model container [2024-08-14 14:27:29,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:27:29" (2/2) ... [2024-08-14 14:27:29,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:27:29,788 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.twocount2.c[1259,1272] [2024-08-14 14:27:29,819 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:27:29,830 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:27:29,842 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.twocount2.c[1259,1272] [2024-08-14 14:27:29,855 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:27:29,871 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:27:29,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29 WrapperNode [2024-08-14 14:27:29,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:27:29,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:27:29,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:27:29,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:27:29,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29" (1/1) ... [2024-08-14 14:27:29,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29" (1/1) ... [2024-08-14 14:27:29,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29" (1/1) ... [2024-08-14 14:27:29,909 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:27:29,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29" (1/1) ... [2024-08-14 14:27:29,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29" (1/1) ... [2024-08-14 14:27:29,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29" (1/1) ... [2024-08-14 14:27:29,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29" (1/1) ... [2024-08-14 14:27:29,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29" (1/1) ... [2024-08-14 14:27:29,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:27:29,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:27:29,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:27:29,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:27:29,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29" (1/1) ... [2024-08-14 14:27:29,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:27:29,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:29,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:27:29,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:27:30,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:27:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:27:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:27:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:27:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:27:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:27:30,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:27:30,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:27:30,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:27:30,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:27:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:27:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:27:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:27:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:27:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:27:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:27:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:27:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:27:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:27:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:27:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:27:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:27:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:27:30,106 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:27:30,108 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:27:30,307 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-08-14 14:27:30,307 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:27:30,318 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:27:30,319 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:27:30,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:30 BoogieIcfgContainer [2024-08-14 14:27:30,321 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:27:30,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:27:30,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:27:30,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:27:30,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:27" (1/4) ... [2024-08-14 14:27:30,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24893dd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:27:30, skipping insertion in model container [2024-08-14 14:27:30,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:27:29" (2/4) ... [2024-08-14 14:27:30,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24893dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:30, skipping insertion in model container [2024-08-14 14:27:30,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:29" (3/4) ... [2024-08-14 14:27:30,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24893dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:30, skipping insertion in model container [2024-08-14 14:27:30,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:30" (4/4) ... [2024-08-14 14:27:30,332 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2024-08-14 14:27:30,332 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:27:30,353 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:27:30,354 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:27:30,374 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [21] [2024-08-14 14:27:30,377 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:30,437 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 191 states to 110 states. [2024-08-14 14:27:30,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:27:30,460 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;@1ba0bc1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:27:30,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:27:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2024-08-14 14:27:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-08-14 14:27:30,473 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:30,473 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:30,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:30,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1590109173, now seen corresponding path program 1 times [2024-08-14 14:27:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:27:30,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673624891] [2024-08-14 14:27:30,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:30,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:27:30,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:27:30,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-14 14:27:30,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-08-14 14:27:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:30,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:27:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:30,897 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:27:30,899 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:27:30,900 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:27:30,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-08-14 14:27:31,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:27:31,111 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:27:31,114 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:27:31,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:27:31 BoogieIcfgContainer [2024-08-14 14:27:31,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:27:31,148 INFO L158 Benchmark]: Toolchain (without parser) took 1567.81ms. Allocated memory is still 79.7MB. Free memory was 44.2MB in the beginning and 49.3MB in the end (delta: -5.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-08-14 14:27:31,148 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 54.5MB. Free memory is still 37.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:31,148 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory is still 34.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:31,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.61ms. Allocated memory is still 79.7MB. Free memory was 44.0MB in the beginning and 50.8MB in the end (delta: -6.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-08-14 14:27:31,149 INFO L158 Benchmark]: Boogie Preprocessor took 58.01ms. Allocated memory is still 79.7MB. Free memory was 50.8MB in the beginning and 48.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-14 14:27:31,149 INFO L158 Benchmark]: IcfgBuilder took 389.78ms. Allocated memory is still 79.7MB. Free memory was 48.4MB in the beginning and 56.9MB in the end (delta: -8.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-08-14 14:27:31,150 INFO L158 Benchmark]: TraceAbstraction took 824.29ms. Allocated memory is still 79.7MB. Free memory was 56.1MB in the beginning and 49.3MB in the end (delta: 6.7MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-08-14 14:27:31,153 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.18ms. Allocated memory is still 54.5MB. Free memory is still 37.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory is still 34.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.61ms. Allocated memory is still 79.7MB. Free memory was 44.0MB in the beginning and 50.8MB in the end (delta: -6.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.01ms. Allocated memory is still 79.7MB. Free memory was 50.8MB in the beginning and 48.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 389.78ms. Allocated memory is still 79.7MB. Free memory was 48.4MB in the beginning and 56.9MB in the end (delta: -8.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 824.29ms. Allocated memory is still 79.7MB. Free memory was 56.1MB in the beginning and 49.3MB in the end (delta: 6.7MB). Peak memory consumption was 26.8MB. 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: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 2); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = mask_SORT_2; [L37] SORT_1 input_3; [L39] SORT_2 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L42] SORT_2 init_7_arg_1 = var_4; [L43] state_5 = init_7_arg_1 [L44] SORT_2 init_8_arg_1 = var_4; [L45] state_6 = init_8_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=1, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=1, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=1, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=1, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=1, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=1, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=2, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=2, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=1, input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=0] [L22] COND TRUE !(cond) VAL [\old(cond)=0] [L22] 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: 7, 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=110occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-14 14:27:31,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE