./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.factorial4even.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 03fe66fa 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.factorial4even.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.factorial4even.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-03fe66f-m [2024-08-15 18:19:24,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:19:24,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-15 18:19:24,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:19:24,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:19:24,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:19:24,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:19:24,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:19:24,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:19:24,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:19:24,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:19:24,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:19:24,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:19:24,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:19:24,231 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:19:24,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:19:24,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:19:24,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-15 18:19:24,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:19:24,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:19:24,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:19:24,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:19:24,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:19:24,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:19:24,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:19:24,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:19:24,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:19:24,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:19:24,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:19:24,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:19:24,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:19:24,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:19:24,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:19:24,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-15 18:19:24,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-15 18:19:24,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:19:24,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:19:24,241 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:19:24,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:19:24,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:19:24,242 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-15 18:19:24,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:19:24,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:19:24,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:19:24,584 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:19:24,585 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:19:24,587 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.factorial4even.yml/witness.yml [2024-08-15 18:19:24,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:19:24,738 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:19:24,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-08-15 18:19:26,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:19:26,448 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:19:26,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-08-15 18:19:26,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0ba301f/9bcd6e1ca4e74341b275ad0db71c84bd/FLAGefd94360c [2024-08-15 18:19:26,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0ba301f/9bcd6e1ca4e74341b275ad0db71c84bd [2024-08-15 18:19:26,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:19:26,808 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:19:26,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:19:26,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:19:26,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:19:26,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:19:24" (1/2) ... [2024-08-15 18:19:26,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28777c86 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:26, skipping insertion in model container [2024-08-15 18:19:26,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:19:24" (1/2) ... [2024-08-15 18:19:26,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1d5b8655 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:26, skipping insertion in model container [2024-08-15 18:19:26,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:19:26" (2/2) ... [2024-08-15 18:19:26,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28777c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:26, skipping insertion in model container [2024-08-15 18:19:26,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:19:26" (2/2) ... [2024-08-15 18:19:26,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:19:27,014 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.factorial4even.c[1439,1452] [2024-08-15 18:19:27,056 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:19:27,076 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:19:27,089 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.factorial4even.c[1439,1452] [2024-08-15 18:19:27,111 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:19:27,129 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:19:27,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27 WrapperNode [2024-08-15 18:19:27,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:19:27,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:19:27,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:19:27,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:19:27,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27" (1/1) ... [2024-08-15 18:19:27,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27" (1/1) ... [2024-08-15 18:19:27,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27" (1/1) ... [2024-08-15 18:19:27,195 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-15 18:19:27,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27" (1/1) ... [2024-08-15 18:19:27,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27" (1/1) ... [2024-08-15 18:19:27,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27" (1/1) ... [2024-08-15 18:19:27,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27" (1/1) ... [2024-08-15 18:19:27,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27" (1/1) ... [2024-08-15 18:19:27,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:19:27,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:19:27,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:19:27,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:19:27,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27" (1/1) ... [2024-08-15 18:19:27,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:19:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:27,257 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-15 18:19:27,260 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-15 18:19:27,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:19:27,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:19:27,308 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:19:27,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:19:27,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:19:27,309 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:19:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:19:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:19:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:19:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:19:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:19:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:19:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-15 18:19:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:19:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-15 18:19:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-15 18:19:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:19:27,440 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:19:27,448 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:19:27,835 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-08-15 18:19:27,835 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:19:27,846 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:19:27,847 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:19:27,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:19:27 BoogieIcfgContainer [2024-08-15 18:19:27,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:19:27,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:19:27,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:19:27,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:19:27,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:19:24" (1/4) ... [2024-08-15 18:19:27,858 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:19:27,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b095429 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:19:27, skipping insertion in model container [2024-08-15 18:19:27,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:19:26" (2/4) ... [2024-08-15 18:19:27,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b095429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:19:27, skipping insertion in model container [2024-08-15 18:19:27,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:27" (3/4) ... [2024-08-15 18:19:27,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b095429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:19:27, skipping insertion in model container [2024-08-15 18:19:27,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:19:27" (4/4) ... [2024-08-15 18:19:27,863 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-08-15 18:19:27,879 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:19:27,879 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:19:27,912 INFO L90 WitnessUtils]: Constructing product of automaton with 38 states and violation witness of the following lengths: [87] [2024-08-15 18:19:28,170 INFO L95 WitnessUtils]: Product has 1525 reachable states. [2024-08-15 18:19:28,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:19:28,204 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;@367bd235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:19:28,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:19:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2082 transitions. [2024-08-15 18:19:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-08-15 18:19:28,242 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:28,243 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:19:28,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:28,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash -382030488, now seen corresponding path program 1 times [2024-08-15 18:19:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:28,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416051610] [2024-08-15 18:19:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-08-15 18:19:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-08-15 18:19:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-08-15 18:19:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-15 18:19:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-08-15 18:19:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-08-15 18:19:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-08-15 18:19:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-08-15 18:19:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-08-15 18:19:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-15 18:19:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-08-15 18:19:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-08-15 18:19:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-08-15 18:19:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-08-15 18:19:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-08-15 18:19:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-08-15 18:19:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-08-15 18:19:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-08-15 18:19:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-08-15 18:19:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-08-15 18:19:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-08-15 18:19:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-08-15 18:19:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-08-15 18:19:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-08-15 18:19:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-08-15 18:19:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-08-15 18:19:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-15 18:19:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-08-15 18:19:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2597 backedges. 56 proven. 41 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2024-08-15 18:19:31,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:31,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416051610] [2024-08-15 18:19:31,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416051610] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:19:31,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399334271] [2024-08-15 18:19:31,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:31,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:31,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:31,556 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-15 18:19:31,558 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-15 18:19:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:31,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 67 conjunts are in the unsatisfiable core [2024-08-15 18:19:31,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:19:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2597 backedges. 144 proven. 235 refuted. 0 times theorem prover too weak. 2218 trivial. 0 not checked. [2024-08-15 18:19:32,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:19:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2597 backedges. 184 proven. 58 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2024-08-15 18:19:33,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399334271] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:19:33,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:19:33,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 14] total 27 [2024-08-15 18:19:33,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210057104] [2024-08-15 18:19:33,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:19:33,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-08-15 18:19:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:33,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-08-15 18:19:33,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2024-08-15 18:19:33,895 INFO L87 Difference]: Start difference. First operand 1525 states and 2082 transitions. Second operand has 27 states, 22 states have (on average 3.727272727272727) internal successors, (82), 26 states have internal predecessors, (82), 12 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2024-08-15 18:19:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:34,483 INFO L93 Difference]: Finished difference Result 678 states and 871 transitions. [2024-08-15 18:19:34,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-15 18:19:34,486 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 3.727272727272727) internal successors, (82), 26 states have internal predecessors, (82), 12 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) Word has length 281 [2024-08-15 18:19:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:34,500 INFO L225 Difference]: With dead ends: 678 [2024-08-15 18:19:34,501 INFO L226 Difference]: Without dead ends: 624 [2024-08-15 18:19:34,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 600 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2024-08-15 18:19:34,506 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 337 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:34,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 250 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-15 18:19:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-08-15 18:19:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 342. [2024-08-15 18:19:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 277 states have (on average 1.3285198555956679) internal successors, (368), 279 states have internal predecessors, (368), 33 states have call successors, (33), 32 states have call predecessors, (33), 31 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-08-15 18:19:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 433 transitions. [2024-08-15 18:19:34,606 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 433 transitions. Word has length 281 [2024-08-15 18:19:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:34,609 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 433 transitions. [2024-08-15 18:19:34,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 3.727272727272727) internal successors, (82), 26 states have internal predecessors, (82), 12 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2024-08-15 18:19:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 433 transitions. [2024-08-15 18:19:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-08-15 18:19:34,615 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:34,615 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:19:34,639 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-15 18:19:34,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-08-15 18:19:34,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:34,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:34,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1114230758, now seen corresponding path program 1 times [2024-08-15 18:19:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019340582] [2024-08-15 18:19:34,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-08-15 18:19:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-08-15 18:19:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-08-15 18:19:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-15 18:19:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-08-15 18:19:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-08-15 18:19:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-08-15 18:19:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-08-15 18:19:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-08-15 18:19:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-15 18:19:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-08-15 18:19:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-08-15 18:19:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-08-15 18:19:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-08-15 18:19:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-08-15 18:19:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-08-15 18:19:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-08-15 18:19:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-08-15 18:19:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-08-15 18:19:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-08-15 18:19:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-08-15 18:19:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-08-15 18:19:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-08-15 18:19:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-08-15 18:19:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-08-15 18:19:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-08-15 18:19:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-15 18:19:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-08-15 18:19:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2597 backedges. 97 proven. 130 refuted. 0 times theorem prover too weak. 2370 trivial. 0 not checked. [2024-08-15 18:19:35,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:35,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019340582] [2024-08-15 18:19:35,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019340582] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:19:35,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612750583] [2024-08-15 18:19:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:35,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:35,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:35,940 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-15 18:19:35,942 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-15 18:19:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:36,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-15 18:19:36,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:19:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2597 backedges. 97 proven. 130 refuted. 0 times theorem prover too weak. 2370 trivial. 0 not checked. [2024-08-15 18:19:36,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:19:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2597 backedges. 97 proven. 130 refuted. 0 times theorem prover too weak. 2370 trivial. 0 not checked. [2024-08-15 18:19:37,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612750583] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:19:37,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:19:37,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-08-15 18:19:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852401541] [2024-08-15 18:19:37,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:19:37,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-15 18:19:37,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:37,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-15 18:19:37,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-08-15 18:19:37,105 INFO L87 Difference]: Start difference. First operand 342 states and 433 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-08-15 18:19:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:37,210 INFO L93 Difference]: Finished difference Result 522 states and 697 transitions. [2024-08-15 18:19:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-15 18:19:37,212 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 282 [2024-08-15 18:19:37,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:37,216 INFO L225 Difference]: With dead ends: 522 [2024-08-15 18:19:37,218 INFO L226 Difference]: Without dead ends: 522 [2024-08-15 18:19:37,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 617 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-08-15 18:19:37,219 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 73 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:37,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 183 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:19:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-08-15 18:19:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2024-08-15 18:19:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 429 states have (on average 1.3426573426573427) internal successors, (576), 432 states have internal predecessors, (576), 61 states have call successors, (61), 32 states have call predecessors, (61), 31 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-08-15 18:19:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 697 transitions. [2024-08-15 18:19:37,262 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 697 transitions. Word has length 282 [2024-08-15 18:19:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:37,266 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 697 transitions. [2024-08-15 18:19:37,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-08-15 18:19:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 697 transitions. [2024-08-15 18:19:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-08-15 18:19:37,271 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:37,272 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:19:37,295 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-15 18:19:37,478 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,SelfDestructingSolverStorable1 [2024-08-15 18:19:37,479 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:37,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -509771950, now seen corresponding path program 2 times [2024-08-15 18:19:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094216123] [2024-08-15 18:19:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-08-15 18:19:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-08-15 18:19:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-08-15 18:19:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:19:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-08-15 18:19:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-08-15 18:19:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-08-15 18:19:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-15 18:19:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-08-15 18:19:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-08-15 18:19:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-08-15 18:19:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-15 18:19:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-08-15 18:19:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-08-15 18:19:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-15 18:19:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-08-15 18:19:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-08-15 18:19:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-08-15 18:19:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-08-15 18:19:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-08-15 18:19:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-08-15 18:19:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-08-15 18:19:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-08-15 18:19:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-08-15 18:19:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-08-15 18:19:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-15 18:19:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-08-15 18:19:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-08-15 18:19:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2598 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 2409 trivial. 0 not checked. [2024-08-15 18:19:38,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:38,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094216123] [2024-08-15 18:19:38,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094216123] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:19:38,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:19:38,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-15 18:19:38,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629609601] [2024-08-15 18:19:38,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:19:38,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-15 18:19:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:38,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-15 18:19:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-15 18:19:38,491 INFO L87 Difference]: Start difference. First operand 522 states and 697 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-08-15 18:19:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:38,561 INFO L93 Difference]: Finished difference Result 522 states and 696 transitions. [2024-08-15 18:19:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-15 18:19:38,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 283 [2024-08-15 18:19:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:38,564 INFO L225 Difference]: With dead ends: 522 [2024-08-15 18:19:38,564 INFO L226 Difference]: Without dead ends: 522 [2024-08-15 18:19:38,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:19:38,566 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:38,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 84 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:19:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-08-15 18:19:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2024-08-15 18:19:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 429 states have (on average 1.3403263403263403) internal successors, (575), 432 states have internal predecessors, (575), 61 states have call successors, (61), 32 states have call predecessors, (61), 31 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-08-15 18:19:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 696 transitions. [2024-08-15 18:19:38,588 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 696 transitions. Word has length 283 [2024-08-15 18:19:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:38,589 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 696 transitions. [2024-08-15 18:19:38,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-08-15 18:19:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 696 transitions. [2024-08-15 18:19:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-08-15 18:19:38,594 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:38,595 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:19:38,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-15 18:19:38,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:38,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1550150547, now seen corresponding path program 1 times [2024-08-15 18:19:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:38,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542263493] [2024-08-15 18:19:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-08-15 18:19:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-08-15 18:19:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-08-15 18:19:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:19:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-08-15 18:19:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-08-15 18:19:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-08-15 18:19:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-15 18:19:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-08-15 18:19:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-08-15 18:19:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-08-15 18:19:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-15 18:19:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-08-15 18:19:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-08-15 18:19:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-15 18:19:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-08-15 18:19:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-08-15 18:19:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-08-15 18:19:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-08-15 18:19:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-08-15 18:19:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-08-15 18:19:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-08-15 18:19:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-08-15 18:19:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-08-15 18:19:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-08-15 18:19:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-15 18:19:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-08-15 18:19:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-08-15 18:19:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2598 backedges. 226 proven. 14 refuted. 0 times theorem prover too weak. 2358 trivial. 0 not checked. [2024-08-15 18:19:39,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:39,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542263493] [2024-08-15 18:19:39,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542263493] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:19:39,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676080779] [2024-08-15 18:19:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:39,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:39,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:39,631 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-15 18:19:39,632 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-15 18:19:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:39,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-15 18:19:40,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:19:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2598 backedges. 1147 proven. 3 refuted. 0 times theorem prover too weak. 1448 trivial. 0 not checked. [2024-08-15 18:19:40,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:19:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2598 backedges. 518 proven. 32 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2024-08-15 18:19:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676080779] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:19:40,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:19:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2024-08-15 18:19:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672276520] [2024-08-15 18:19:40,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:19:40,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-15 18:19:40,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:40,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-15 18:19:40,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-08-15 18:19:40,680 INFO L87 Difference]: Start difference. First operand 522 states and 696 transitions. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 10 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2024-08-15 18:19:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:40,839 INFO L93 Difference]: Finished difference Result 335 states and 411 transitions. [2024-08-15 18:19:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:19:40,840 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 10 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) Word has length 283 [2024-08-15 18:19:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:40,841 INFO L225 Difference]: With dead ends: 335 [2024-08-15 18:19:40,841 INFO L226 Difference]: Without dead ends: 335 [2024-08-15 18:19:40,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-08-15 18:19:40,843 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:40,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 142 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:19:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-08-15 18:19:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2024-08-15 18:19:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 272 states have (on average 1.2794117647058822) internal successors, (348), 273 states have internal predecessors, (348), 32 states have call successors, (32), 31 states have call predecessors, (32), 30 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-08-15 18:19:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 411 transitions. [2024-08-15 18:19:40,858 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 411 transitions. Word has length 283 [2024-08-15 18:19:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:40,859 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 411 transitions. [2024-08-15 18:19:40,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 10 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2024-08-15 18:19:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 411 transitions. [2024-08-15 18:19:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-08-15 18:19:40,864 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:40,864 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:19:40,887 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-15 18:19:41,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:41,079 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:41,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:41,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1665714447, now seen corresponding path program 1 times [2024-08-15 18:19:41,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:41,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195246454] [2024-08-15 18:19:41,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:19:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-08-15 18:19:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-08-15 18:19:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-08-15 18:19:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:19:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-08-15 18:19:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-15 18:19:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-08-15 18:19:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-08-15 18:19:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-15 18:19:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-08-15 18:19:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-08-15 18:19:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-08-15 18:19:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-08-15 18:19:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-08-15 18:19:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-08-15 18:19:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-08-15 18:19:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-08-15 18:19:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-08-15 18:19:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-08-15 18:19:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-08-15 18:19:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-08-15 18:19:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-08-15 18:19:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-08-15 18:19:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-08-15 18:19:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-08-15 18:19:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-08-15 18:19:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-08-15 18:19:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-08-15 18:19:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 337 proven. 11 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2024-08-15 18:19:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:19:43,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195246454] [2024-08-15 18:19:43,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195246454] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:19:43,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186481733] [2024-08-15 18:19:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:43,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:43,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:43,166 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-15 18:19:43,167 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-15 18:19:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:19:43,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 58 conjunts are in the unsatisfiable core [2024-08-15 18:19:43,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:19:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 436 proven. 10 refuted. 0 times theorem prover too weak. 2242 trivial. 0 not checked. [2024-08-15 18:19:44,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:19:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 326 proven. 7 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2024-08-15 18:19:44,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186481733] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:19:44,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:19:44,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 12] total 23 [2024-08-15 18:19:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206861133] [2024-08-15 18:19:44,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:19:44,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-15 18:19:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:19:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-15 18:19:44,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-08-15 18:19:44,512 INFO L87 Difference]: Start difference. First operand 335 states and 411 transitions. Second operand has 23 states, 20 states have (on average 5.0) internal successors, (100), 23 states have internal predecessors, (100), 9 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2024-08-15 18:19:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:19:45,108 INFO L93 Difference]: Finished difference Result 371 states and 446 transitions. [2024-08-15 18:19:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-15 18:19:45,109 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.0) internal successors, (100), 23 states have internal predecessors, (100), 9 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) Word has length 295 [2024-08-15 18:19:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:19:45,111 INFO L225 Difference]: With dead ends: 371 [2024-08-15 18:19:45,111 INFO L226 Difference]: Without dead ends: 338 [2024-08-15 18:19:45,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2024-08-15 18:19:45,113 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 137 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:19:45,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 333 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-15 18:19:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-08-15 18:19:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-08-15 18:19:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 274 states have (on average 1.2335766423357664) internal successors, (338), 276 states have internal predecessors, (338), 33 states have call successors, (33), 31 states have call predecessors, (33), 30 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-08-15 18:19:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 402 transitions. [2024-08-15 18:19:45,124 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 402 transitions. Word has length 295 [2024-08-15 18:19:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:19:45,124 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 402 transitions. [2024-08-15 18:19:45,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.0) internal successors, (100), 23 states have internal predecessors, (100), 9 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2024-08-15 18:19:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 402 transitions. [2024-08-15 18:19:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-08-15 18:19:45,129 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:45,129 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:19:45,152 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-15 18:19:45,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:45,334 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:45,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash -548659941, now seen corresponding path program 2 times [2024-08-15 18:19:45,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:45,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357173103] [2024-08-15 18:19:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:19:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-08-15 18:19:46,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038044675] [2024-08-15 18:19:46,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-15 18:19:46,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:19:46,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:46,235 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-15 18:19:46,236 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-15 18:19:48,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-15 18:19:48,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-15 18:19:48,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 360 conjunts are in the unsatisfiable core [2024-08-15 18:19:48,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:13,788 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-08-15 18:23:13,789 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 101 [2024-08-15 18:23:13,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:13,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357173103] [2024-08-15 18:23:13,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-08-15 18:23:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038044675] [2024-08-15 18:23:13,790 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-08-15 18:23:13,811 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-15 18:23:13,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:13,992 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 44 more [2024-08-15 18:23:13,996 INFO L158 Benchmark]: Toolchain (without parser) took 227188.35ms. Allocated memory was 178.3MB in the beginning and 614.5MB in the end (delta: 436.2MB). Free memory was 135.6MB in the beginning and 352.4MB in the end (delta: -216.8MB). Peak memory consumption was 219.8MB. Max. memory is 16.1GB. [2024-08-15 18:23:13,997 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:23:13,997 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:23:13,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.11ms. Allocated memory is still 178.3MB. Free memory was 134.6MB in the beginning and 121.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-15 18:23:13,997 INFO L158 Benchmark]: Boogie Preprocessor took 72.29ms. Allocated memory is still 178.3MB. Free memory was 121.9MB in the beginning and 118.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-15 18:23:13,997 INFO L158 Benchmark]: IcfgBuilder took 642.27ms. Allocated memory is still 178.3MB. Free memory was 118.8MB in the beginning and 133.5MB in the end (delta: -14.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-15 18:23:13,998 INFO L158 Benchmark]: TraceAbstraction took 226146.16ms. Allocated memory was 178.3MB in the beginning and 614.5MB in the end (delta: 436.2MB). Free memory was 132.6MB in the beginning and 352.4MB in the end (delta: -219.8MB). Peak memory consumption was 219.8MB. Max. memory is 16.1GB. [2024-08-15 18:23:13,999 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.13ms. Allocated memory is still 104.9MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.11ms. Allocated memory is still 178.3MB. Free memory was 134.6MB in the beginning and 121.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.29ms. Allocated memory is still 178.3MB. Free memory was 121.9MB in the beginning and 118.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 642.27ms. Allocated memory is still 178.3MB. Free memory was 118.8MB in the beginning and 133.5MB in the end (delta: -14.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 226146.16ms. Allocated memory was 178.3MB in the beginning and 614.5MB in the end (delta: 436.2MB). Free memory was 132.6MB in the beginning and 352.4MB in the end (delta: -219.8MB). Peak memory consumption was 219.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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.factorial4even.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.factorial4even.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-03fe66f-m [2024-08-15 18:23:16,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:23:16,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-15 18:23:16,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:23:16,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:23:16,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:23:16,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:23:16,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:23:16,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:23:16,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:23:16,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:23:16,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:23:16,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:23:16,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:23:16,376 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:23:16,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:23:16,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:23:16,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:23:16,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:23:16,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:23:16,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:23:16,384 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-15 18:23:16,384 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-15 18:23:16,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:23:16,384 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-15 18:23:16,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:23:16,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:23:16,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:23:16,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:23:16,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:23:16,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:23:16,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:23:16,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:23:16,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:23:16,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:23:16,387 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-15 18:23:16,388 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-15 18:23:16,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:23:16,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:23:16,389 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:23:16,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:23:16,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:23:16,391 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-15 18:23:16,391 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-15 18:23:16,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:23:16,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:23:16,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:23:16,768 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:23:16,768 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:23:16,770 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.factorial4even.yml/witness.yml [2024-08-15 18:23:16,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:23:16,906 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:23:16,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-08-15 18:23:18,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:23:18,960 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:23:18,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-08-15 18:23:18,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e746ec324/0f16ec0392524565bfb92e5e55ad0069/FLAG535626660 [2024-08-15 18:23:18,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e746ec324/0f16ec0392524565bfb92e5e55ad0069 [2024-08-15 18:23:18,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:23:18,991 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:23:18,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:23:18,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:23:19,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:23:19,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:23:16" (1/2) ... [2024-08-15 18:23:19,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2abecd84 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:19, skipping insertion in model container [2024-08-15 18:23:19,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:23:16" (1/2) ... [2024-08-15 18:23:19,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4c9c370b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:19, skipping insertion in model container [2024-08-15 18:23:19,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:23:18" (2/2) ... [2024-08-15 18:23:19,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2abecd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19, skipping insertion in model container [2024-08-15 18:23:19,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:23:18" (2/2) ... [2024-08-15 18:23:19,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:23:19,199 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.factorial4even.c[1439,1452] [2024-08-15 18:23:19,240 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:23:19,253 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:23:19,268 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.factorial4even.c[1439,1452] [2024-08-15 18:23:19,305 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:23:19,331 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:23:19,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19 WrapperNode [2024-08-15 18:23:19,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:23:19,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:23:19,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:23:19,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:23:19,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19" (1/1) ... [2024-08-15 18:23:19,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19" (1/1) ... [2024-08-15 18:23:19,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19" (1/1) ... [2024-08-15 18:23:19,375 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-15 18:23:19,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19" (1/1) ... [2024-08-15 18:23:19,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19" (1/1) ... [2024-08-15 18:23:19,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19" (1/1) ... [2024-08-15 18:23:19,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19" (1/1) ... [2024-08-15 18:23:19,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19" (1/1) ... [2024-08-15 18:23:19,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:23:19,397 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:23:19,397 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:23:19,397 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:23:19,398 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19" (1/1) ... [2024-08-15 18:23:19,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:23:19,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:19,433 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-15 18:23:19,439 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-15 18:23:19,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:23:19,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:23:19,490 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:23:19,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:23:19,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:23:19,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:23:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:23:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:23:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:23:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-15 18:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:23:19,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-15 18:23:19,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-15 18:23:19,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:23:19,582 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:23:19,585 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:23:19,767 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-08-15 18:23:19,770 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:23:19,781 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:23:19,783 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:23:19,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:23:19 BoogieIcfgContainer [2024-08-15 18:23:19,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:23:19,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:23:19,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:23:19,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:23:19,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:23:16" (1/4) ... [2024-08-15 18:23:19,791 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:23:19,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c47449d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:23:19, skipping insertion in model container [2024-08-15 18:23:19,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:23:18" (2/4) ... [2024-08-15 18:23:19,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c47449d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:23:19, skipping insertion in model container [2024-08-15 18:23:19,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:19" (3/4) ... [2024-08-15 18:23:19,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c47449d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:23:19, skipping insertion in model container [2024-08-15 18:23:19,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:23:19" (4/4) ... [2024-08-15 18:23:19,796 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-08-15 18:23:19,817 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:23:19,818 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:23:19,849 INFO L90 WitnessUtils]: Constructing product of automaton with 23 states and violation witness of the following lengths: [87] [2024-08-15 18:23:20,036 INFO L95 WitnessUtils]: Product has 997 reachable states. [2024-08-15 18:23:20,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:23:20,068 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;@21625261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:23:20,068 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:23:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1202 transitions. [2024-08-15 18:23:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-08-15 18:23:20,104 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:20,105 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:20,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:20,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash 122446423, now seen corresponding path program 1 times [2024-08-15 18:23:20,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-15 18:23:20,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279981965] [2024-08-15 18:23:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:20,130 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-15 18:23:20,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-15 18:23:20,132 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-15 18:23:20,133 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-15 18:23:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:23:20,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:23:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:23:21,046 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-15 18:23:21,050 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:23:21,051 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:23:21,063 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-15 18:23:21,257 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-15 18:23:21,262 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-15 18:23:21,266 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:23:21,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:23:21 BoogieIcfgContainer [2024-08-15 18:23:21,353 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:23:21,354 INFO L158 Benchmark]: Toolchain (without parser) took 2362.58ms. Allocated memory was 88.1MB in the beginning and 127.9MB in the end (delta: 39.8MB). Free memory was 51.5MB in the beginning and 89.7MB in the end (delta: -38.2MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-08-15 18:23:21,354 INFO L158 Benchmark]: Witness Parser took 0.25ms. Allocated memory is still 88.1MB. Free memory was 69.5MB in the beginning and 69.4MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:23:21,355 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 88.1MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:23:21,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.30ms. Allocated memory is still 88.1MB. Free memory was 51.5MB in the beginning and 66.5MB in the end (delta: -14.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-08-15 18:23:21,356 INFO L158 Benchmark]: Boogie Preprocessor took 62.57ms. Allocated memory is still 88.1MB. Free memory was 66.5MB in the beginning and 64.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-15 18:23:21,357 INFO L158 Benchmark]: IcfgBuilder took 386.61ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 49.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-08-15 18:23:21,357 INFO L158 Benchmark]: TraceAbstraction took 1566.14ms. Allocated memory was 88.1MB in the beginning and 127.9MB in the end (delta: 39.8MB). Free memory was 49.4MB in the beginning and 89.7MB in the end (delta: -40.3MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-08-15 18:23:21,360 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.25ms. Allocated memory is still 88.1MB. Free memory was 69.5MB in the beginning and 69.4MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.10ms. Allocated memory is still 88.1MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.30ms. Allocated memory is still 88.1MB. Free memory was 51.5MB in the beginning and 66.5MB in the end (delta: -14.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.57ms. Allocated memory is still 88.1MB. Free memory was 66.5MB in the beginning and 64.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 386.61ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 49.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1566.14ms. Allocated memory was 88.1MB in the beginning and 127.9MB in the end (delta: 39.8MB). Free memory was 49.4MB in the beginning and 89.7MB in the end (delta: -40.3MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L34] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L35] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L37] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 1); [L38] const SORT_12 msb_SORT_12 = (SORT_12)1 << (1 - 1); [L40] const SORT_1 var_2 = 1; [L41] const SORT_1 var_11 = mask_SORT_1; [L42] const SORT_1 var_16 = 3; [L45] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_4 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 init_5_arg_1 = var_2; [L49] state_3 = init_5_arg_1 [L50] SORT_1 init_6_arg_1 = var_2; [L51] state_4 = init_6_arg_1 VAL [mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=1, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=15, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=0] [L29] COND TRUE !(cond) VAL [\old(cond)=0] [L29] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 1, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred 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.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 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-15 18:23:21,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE