./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 26998269 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.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-2699826-m [2024-08-14 14:25:18,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:25:18,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-14 14:25:18,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:25:18,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:25:19,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:25:19,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:25:19,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:25:19,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:25:19,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:25:19,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:25:19,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:25:19,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:25:19,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:25:19,010 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:25:19,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:25:19,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:25:19,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:25:19,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:25:19,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:25:19,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:25:19,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:25:19,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:25:19,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:25:19,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:25:19,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:25:19,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:25:19,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:25:19,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:25:19,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:25:19,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:25:19,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:25:19,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:25:19,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:25:19,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:25:19,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:25:19,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:25:19,014 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:25:19,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:25:19,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:25:19,015 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:25:19,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:25:19,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:25:19,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:25:19,220 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:25:19,220 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:25:19,221 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-14 14:25:19,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:25:19,326 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:25:19,326 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-14 14:25:20,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:25:20,628 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:25:20,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-08-14 14:25:20,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb822cc8/995b8c69404c45a5a9a72ac3a18b2223/FLAGa562f9f49 [2024-08-14 14:25:20,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb822cc8/995b8c69404c45a5a9a72ac3a18b2223 [2024-08-14 14:25:20,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:25:20,646 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:25:20,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:25:20,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:25:20,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:25:20,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:25:19" (1/2) ... [2024-08-14 14:25:20,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@194358ae and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:20, skipping insertion in model container [2024-08-14 14:25:20,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:25:19" (1/2) ... [2024-08-14 14:25:20,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3840cb61 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:25:20, skipping insertion in model container [2024-08-14 14:25:20,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:25:20" (2/2) ... [2024-08-14 14:25:20,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@194358ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20, skipping insertion in model container [2024-08-14 14:25:20,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:25:20" (2/2) ... [2024-08-14 14:25:20,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:25:20,790 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-14 14:25:20,820 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:25:20,836 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:25:20,847 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-14 14:25:20,862 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:25:20,874 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:25:20,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20 WrapperNode [2024-08-14 14:25:20,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:25:20,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:25:20,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:25:20,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:25:20,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20" (1/1) ... [2024-08-14 14:25:20,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20" (1/1) ... [2024-08-14 14:25:20,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20" (1/1) ... [2024-08-14 14:25:20,902 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:25:20,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20" (1/1) ... [2024-08-14 14:25:20,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20" (1/1) ... [2024-08-14 14:25:20,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20" (1/1) ... [2024-08-14 14:25:20,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20" (1/1) ... [2024-08-14 14:25:20,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20" (1/1) ... [2024-08-14 14:25:20,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:25:20,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:25:20,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:25:20,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:25:20,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20" (1/1) ... [2024-08-14 14:25:20,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:25:20,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:20,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:25:20,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:25:20,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:25:20,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:25:20,991 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:25:20,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:25:20,991 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:25:20,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:25:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:25:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:25:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:25:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:25:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:25:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:25:20,993 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:25:20,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:25:21,062 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:25:21,064 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:25:21,356 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-08-14 14:25:21,356 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:25:21,365 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:25:21,366 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:25:21,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:25:21 BoogieIcfgContainer [2024-08-14 14:25:21,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:25:21,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:25:21,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:25:21,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:25:21,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:25:19" (1/4) ... [2024-08-14 14:25:21,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304f3d5c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:25:21, skipping insertion in model container [2024-08-14 14:25:21,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:25:20" (2/4) ... [2024-08-14 14:25:21,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304f3d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:25:21, skipping insertion in model container [2024-08-14 14:25:21,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:25:20" (3/4) ... [2024-08-14 14:25:21,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304f3d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:25:21, skipping insertion in model container [2024-08-14 14:25:21,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:25:21" (4/4) ... [2024-08-14 14:25:21,375 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-08-14 14:25:21,375 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:25:21,390 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:25:21,391 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:25:21,408 INFO L92 WitnessUtils]: Constructing product of automaton with 38 states and violation witness of the following lengths: [87] [2024-08-14 14:25:21,411 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 38 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:25:21,571 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 1525 states to 1174 states. [2024-08-14 14:25:21,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:25:21,595 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;@7b8aeae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:25:21,595 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:25:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states. [2024-08-14 14:25:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-08-14 14:25:21,626 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:21,626 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-14 14:25:21,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:21,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash -382030488, now seen corresponding path program 1 times [2024-08-14 14:25:21,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505679940] [2024-08-14 14:25:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:21,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-08-14 14:25:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-08-14 14:25:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-08-14 14:25:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:25:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-08-14 14:25:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-08-14 14:25:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-08-14 14:25:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-08-14 14:25:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-08-14 14:25:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-14 14:25:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-08-14 14:25:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-08-14 14:25:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-08-14 14:25:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-08-14 14:25:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-08-14 14:25:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-08-14 14:25:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-08-14 14:25:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-08-14 14:25:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-08-14 14:25:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-08-14 14:25:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-08-14 14:25:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-08-14 14:25:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-08-14 14:25:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-08-14 14:25:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-08-14 14:25:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-08-14 14:25:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-14 14:25:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-08-14 14:25:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:23,783 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-14 14:25:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505679940] [2024-08-14 14:25:23,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505679940] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:23,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121841067] [2024-08-14 14:25:23,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:23,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:23,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:23,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:23,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-14 14:25:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:24,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 67 conjunts are in the unsatisfiable core [2024-08-14 14:25:24,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:24,856 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-14 14:25:24,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:25,519 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-14 14:25:25,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121841067] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:25,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:25,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 14] total 27 [2024-08-14 14:25:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055113806] [2024-08-14 14:25:25,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:25,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-08-14 14:25:25,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:25,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-08-14 14:25:25,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2024-08-14 14:25:25,558 INFO L87 Difference]: Start difference. First operand 1174 states. 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-14 14:25:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:25,988 INFO L93 Difference]: Finished difference Result 651 states and 844 transitions. [2024-08-14 14:25:25,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 14:25:25,993 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-14 14:25:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:25,996 INFO L225 Difference]: With dead ends: 651 [2024-08-14 14:25:25,996 INFO L226 Difference]: Without dead ends: 624 [2024-08-14 14:25:25,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 600 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2024-08-14 14:25:26,000 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.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:26,000 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.2s Time] [2024-08-14 14:25:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-08-14 14:25:26,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 342. [2024-08-14 14:25:26,052 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-14 14:25:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 433 transitions. [2024-08-14 14:25:26,057 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 433 transitions. Word has length 281 [2024-08-14 14:25:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:26,058 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 433 transitions. [2024-08-14 14:25:26,059 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-14 14:25:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 433 transitions. [2024-08-14 14:25:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-08-14 14:25:26,062 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:26,062 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-14 14:25:26,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-08-14 14:25:26,266 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-14 14:25:26,267 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:26,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1114230758, now seen corresponding path program 1 times [2024-08-14 14:25:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:26,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537123845] [2024-08-14 14:25:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-08-14 14:25:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-08-14 14:25:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-08-14 14:25:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:25:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-08-14 14:25:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-08-14 14:25:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-08-14 14:25:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-08-14 14:25:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-08-14 14:25:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-14 14:25:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-08-14 14:25:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-08-14 14:25:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-08-14 14:25:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-08-14 14:25:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-08-14 14:25:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-08-14 14:25:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-08-14 14:25:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-08-14 14:25:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-08-14 14:25:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-08-14 14:25:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-08-14 14:25:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-08-14 14:25:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-08-14 14:25:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-08-14 14:25:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-08-14 14:25:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-08-14 14:25:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-08-14 14:25:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-08-14 14:25:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:26,989 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-14 14:25:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537123845] [2024-08-14 14:25:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537123845] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730606389] [2024-08-14 14:25:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:26,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:26,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:26,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-14 14:25:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:27,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-14 14:25:27,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:27,507 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-14 14:25:27,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:27,824 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-14 14:25:27,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730606389] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:27,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:27,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-08-14 14:25:27,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592343224] [2024-08-14 14:25:27,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:27,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 14:25:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:27,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 14:25:27,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-08-14 14:25:27,827 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-14 14:25:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:27,907 INFO L93 Difference]: Finished difference Result 522 states and 697 transitions. [2024-08-14 14:25:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:25:27,908 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-14 14:25:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:27,910 INFO L225 Difference]: With dead ends: 522 [2024-08-14 14:25:27,910 INFO L226 Difference]: Without dead ends: 522 [2024-08-14 14:25:27,910 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-14 14:25:27,911 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 107 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:27,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 169 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:25:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-08-14 14:25:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2024-08-14 14:25:27,939 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-14 14:25:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 697 transitions. [2024-08-14 14:25:27,945 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 697 transitions. Word has length 282 [2024-08-14 14:25:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:27,946 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 697 transitions. [2024-08-14 14:25:27,946 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-14 14:25:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 697 transitions. [2024-08-14 14:25:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-08-14 14:25:27,949 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:27,949 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-14 14:25:27,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-14 14:25:28,152 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-14 14:25:28,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:28,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash -509771950, now seen corresponding path program 2 times [2024-08-14 14:25:28,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:28,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534149118] [2024-08-14 14:25:28,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:28,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-08-14 14:25:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-08-14 14:25:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-08-14 14:25:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:25:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-08-14 14:25:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-08-14 14:25:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-08-14 14:25:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-14 14:25:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-08-14 14:25:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-08-14 14:25:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-08-14 14:25:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:25:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-08-14 14:25:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-08-14 14:25:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-14 14:25:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-08-14 14:25:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-08-14 14:25:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-08-14 14:25:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-08-14 14:25:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-08-14 14:25:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-08-14 14:25:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-08-14 14:25:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-08-14 14:25:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-08-14 14:25:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-08-14 14:25:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-14 14:25:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-08-14 14:25:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-08-14 14:25:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,830 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-14 14:25:28,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534149118] [2024-08-14 14:25:28,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534149118] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:25:28,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:25:28,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 14:25:28,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711846082] [2024-08-14 14:25:28,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:25:28,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:25:28,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:28,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:25:28,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-14 14:25:28,832 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-14 14:25:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:28,891 INFO L93 Difference]: Finished difference Result 522 states and 696 transitions. [2024-08-14 14:25:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:25:28,892 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-14 14:25:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:28,893 INFO L225 Difference]: With dead ends: 522 [2024-08-14 14:25:28,893 INFO L226 Difference]: Without dead ends: 522 [2024-08-14 14:25:28,894 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-14 14:25:28,894 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.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:28,895 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.0s Time] [2024-08-14 14:25:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-08-14 14:25:28,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2024-08-14 14:25:28,911 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-14 14:25:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 696 transitions. [2024-08-14 14:25:28,914 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 696 transitions. Word has length 283 [2024-08-14 14:25:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:28,914 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 696 transitions. [2024-08-14 14:25:28,915 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-14 14:25:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 696 transitions. [2024-08-14 14:25:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-08-14 14:25:28,918 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:28,918 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-14 14:25:28,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 14:25:28,918 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:28,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1550150547, now seen corresponding path program 1 times [2024-08-14 14:25:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:28,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177564678] [2024-08-14 14:25:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-08-14 14:25:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-08-14 14:25:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-08-14 14:25:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:25:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-08-14 14:25:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-08-14 14:25:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-08-14 14:25:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-14 14:25:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-08-14 14:25:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-08-14 14:25:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-08-14 14:25:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:25:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-08-14 14:25:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-08-14 14:25:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-14 14:25:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-08-14 14:25:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-08-14 14:25:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-08-14 14:25:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-08-14 14:25:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-08-14 14:25:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-08-14 14:25:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-08-14 14:25:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-08-14 14:25:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-08-14 14:25:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-08-14 14:25:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-14 14:25:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-08-14 14:25:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-08-14 14:25:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,564 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-14 14:25:29,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177564678] [2024-08-14 14:25:29,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177564678] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6752177] [2024-08-14 14:25:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:29,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:29,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:29,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:29,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-14 14:25:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:29,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-14 14:25:29,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:29,979 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-14 14:25:29,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:30,231 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-14 14:25:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6752177] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:30,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:30,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2024-08-14 14:25:30,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643498313] [2024-08-14 14:25:30,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:30,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-14 14:25:30,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:30,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-14 14:25:30,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-08-14 14:25:30,234 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-14 14:25:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:30,343 INFO L93 Difference]: Finished difference Result 335 states and 411 transitions. [2024-08-14 14:25:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:25:30,344 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-14 14:25:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:30,345 INFO L225 Difference]: With dead ends: 335 [2024-08-14 14:25:30,345 INFO L226 Difference]: Without dead ends: 335 [2024-08-14 14:25:30,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-08-14 14:25:30,347 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 76 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:30,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 151 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:25:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-08-14 14:25:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2024-08-14 14:25:30,356 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-14 14:25:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 411 transitions. [2024-08-14 14:25:30,357 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 411 transitions. Word has length 283 [2024-08-14 14:25:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:30,357 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 411 transitions. [2024-08-14 14:25:30,357 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-14 14:25:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 411 transitions. [2024-08-14 14:25:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-08-14 14:25:30,362 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:30,362 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-14 14:25:30,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-08-14 14:25:30,562 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-14 14:25:30,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:30,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1665714447, now seen corresponding path program 1 times [2024-08-14 14:25:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:30,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321282667] [2024-08-14 14:25:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-08-14 14:25:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-08-14 14:25:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-08-14 14:25:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:25:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-08-14 14:25:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-14 14:25:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-08-14 14:25:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-08-14 14:25:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:25:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-08-14 14:25:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-08-14 14:25:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-08-14 14:25:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-08-14 14:25:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-08-14 14:25:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-08-14 14:25:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-08-14 14:25:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-08-14 14:25:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-08-14 14:25:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-08-14 14:25:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-08-14 14:25:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-08-14 14:25:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-08-14 14:25:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-08-14 14:25:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-08-14 14:25:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-08-14 14:25:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-08-14 14:25:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-08-14 14:25:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-08-14 14:25:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:31,775 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-14 14:25:31,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:31,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321282667] [2024-08-14 14:25:31,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321282667] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:31,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204791690] [2024-08-14 14:25:31,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:31,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:31,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:31,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:31,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-14 14:25:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:32,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 58 conjunts are in the unsatisfiable core [2024-08-14 14:25:32,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:32,435 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-14 14:25:32,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:32,717 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-14 14:25:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204791690] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:32,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:32,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 12] total 23 [2024-08-14 14:25:32,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506821946] [2024-08-14 14:25:32,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:32,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-14 14:25:32,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:32,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-14 14:25:32,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-08-14 14:25:32,719 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-14 14:25:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:33,184 INFO L93 Difference]: Finished difference Result 371 states and 446 transitions. [2024-08-14 14:25:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 14:25:33,185 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-14 14:25:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:33,186 INFO L225 Difference]: With dead ends: 371 [2024-08-14 14:25:33,186 INFO L226 Difference]: Without dead ends: 338 [2024-08-14 14:25:33,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2024-08-14 14:25:33,187 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 130 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:33,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 334 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:25:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-08-14 14:25:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-08-14 14:25:33,198 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-14 14:25:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 402 transitions. [2024-08-14 14:25:33,199 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 402 transitions. Word has length 295 [2024-08-14 14:25:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:33,199 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 402 transitions. [2024-08-14 14:25:33,200 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-14 14:25:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 402 transitions. [2024-08-14 14:25:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-08-14 14:25:33,202 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:33,202 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-14 14:25:33,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-14 14:25:33,405 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-14 14:25:33,406 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:33,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash -548659941, now seen corresponding path program 2 times [2024-08-14 14:25:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499507567] [2024-08-14 14:25:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-08-14 14:25:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784911291] [2024-08-14 14:25:33,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:25:33,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:33,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:33,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:33,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-14 14:25:35,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:25:35,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:25:35,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 360 conjunts are in the unsatisfiable core [2024-08-14 14:25:35,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:27:35,266 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-14 14:27:35,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:35,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499507567] [2024-08-14 14:27:35,268 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 101 [2024-08-14 14:27:35,268 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-08-14 14:27:35,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784911291] [2024-08-14 14:27:35,268 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-08-14 14:27:35,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-08-14 14:27:35,472 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-14 14:27:35,473 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.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) 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:432) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:320) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:280) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:135) 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) ... 45 more [2024-08-14 14:27:35,476 INFO L158 Benchmark]: Toolchain (without parser) took 134830.56ms. Allocated memory was 174.1MB in the beginning and 572.5MB in the end (delta: 398.5MB). Free memory was 140.3MB in the beginning and 434.4MB in the end (delta: -294.1MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB. [2024-08-14 14:27:35,477 INFO L158 Benchmark]: Witness Parser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:35,477 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:35,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.05ms. Allocated memory is still 174.1MB. Free memory was 140.3MB in the beginning and 127.7MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-14 14:27:35,477 INFO L158 Benchmark]: Boogie Preprocessor took 41.64ms. Allocated memory is still 174.1MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:27:35,477 INFO L158 Benchmark]: IcfgBuilder took 449.51ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 132.9MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-14 14:27:35,477 INFO L158 Benchmark]: TraceAbstraction took 134107.57ms. Allocated memory was 174.1MB in the beginning and 572.5MB in the end (delta: 398.5MB). Free memory was 131.9MB in the beginning and 434.4MB in the end (delta: -302.5MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2024-08-14 14:27:35,478 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.23ms. Allocated memory is still 104.9MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.05ms. Allocated memory is still 174.1MB. Free memory was 140.3MB in the beginning and 127.7MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.64ms. Allocated memory is still 174.1MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 449.51ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 132.9MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 134107.57ms. Allocated memory was 174.1MB in the beginning and 572.5MB in the end (delta: 398.5MB). Free memory was 131.9MB in the beginning and 434.4MB in the end (delta: -302.5MB). Peak memory consumption was 98.0MB. 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-2699826-m [2024-08-14 14:27:37,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:27:37,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-14 14:27:37,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:27:37,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:27:37,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:27:37,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:27:37,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:27:37,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:27:37,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:27:37,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:27:37,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:27:37,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:27:37,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:27:37,126 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:27:37,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:27:37,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:27:37,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:27:37,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:27:37,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:27:37,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:27:37,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:27:37,127 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:27:37,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:27:37,127 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:27:37,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:27:37,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:27:37,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:27:37,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:27:37,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:27:37,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:27:37,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:27:37,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:27:37,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:27:37,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:27:37,129 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:27:37,129 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:27:37,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:27:37,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:27:37,129 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:27:37,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:27:37,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:27:37,131 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:27:37,131 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:27:37,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:27:37,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:27:37,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:27:37,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:27:37,373 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:27:37,374 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-14 14:27:38,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:27:38,732 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:27:38,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-08-14 14:27:38,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81093762f/eb426dd2599f4e63bd5650f94801d6fc/FLAG43476f467 [2024-08-14 14:27:38,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81093762f/eb426dd2599f4e63bd5650f94801d6fc [2024-08-14 14:27:38,762 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:27:38,763 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:27:38,764 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-14 14:27:38,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:27:38,862 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:27:38,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:27:38,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:27:38,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:27:38,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:27:38" (1/2) ... [2024-08-14 14:27:38,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7995e038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:38, skipping insertion in model container [2024-08-14 14:27:38,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:27:38" (1/2) ... [2024-08-14 14:27:38,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6b1d90e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:38, skipping insertion in model container [2024-08-14 14:27:38,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:38" (2/2) ... [2024-08-14 14:27:38,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7995e038 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:38, skipping insertion in model container [2024-08-14 14:27:38,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:38" (2/2) ... [2024-08-14 14:27:38,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:27:39,010 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-14 14:27:39,053 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:27:39,064 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:27:39,074 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-14 14:27:39,092 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:27:39,105 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:27:39,105 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39 WrapperNode [2024-08-14 14:27:39,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:27:39,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:27:39,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:27:39,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:27:39,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39" (1/1) ... [2024-08-14 14:27:39,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39" (1/1) ... [2024-08-14 14:27:39,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39" (1/1) ... [2024-08-14 14:27:39,141 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:27:39,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39" (1/1) ... [2024-08-14 14:27:39,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39" (1/1) ... [2024-08-14 14:27:39,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39" (1/1) ... [2024-08-14 14:27:39,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39" (1/1) ... [2024-08-14 14:27:39,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39" (1/1) ... [2024-08-14 14:27:39,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:27:39,159 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:27:39,159 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:27:39,159 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:27:39,160 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39" (1/1) ... [2024-08-14 14:27:39,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:27:39,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:39,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:27:39,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:27:39,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:27:39,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:27:39,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:27:39,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:27:39,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:27:39,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:27:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:27:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:27:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:27:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:27:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:27:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:27:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:27:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:27:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:27:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:27:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:27:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:27:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:27:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:27:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:27:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:27:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:27:39,306 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:27:39,309 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:27:39,455 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-08-14 14:27:39,455 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:27:39,464 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:27:39,465 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:27:39,465 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:39 BoogieIcfgContainer [2024-08-14 14:27:39,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:27:39,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:27:39,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:27:39,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:27:39,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:27:38" (1/4) ... [2024-08-14 14:27:39,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f9e9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:39, skipping insertion in model container [2024-08-14 14:27:39,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:38" (2/4) ... [2024-08-14 14:27:39,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f9e9c1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:27:39, skipping insertion in model container [2024-08-14 14:27:39,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:39" (3/4) ... [2024-08-14 14:27:39,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f9e9c1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:27:39, skipping insertion in model container [2024-08-14 14:27:39,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:39" (4/4) ... [2024-08-14 14:27:39,473 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-08-14 14:27:39,474 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:27:39,494 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:27:39,494 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:27:39,521 INFO L92 WitnessUtils]: Constructing product of automaton with 23 states and violation witness of the following lengths: [87] [2024-08-14 14:27:39,525 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:27:39,676 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 997 states to 646 states. [2024-08-14 14:27:39,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:27:39,700 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;@5678b615, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:27:39,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:27:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states. [2024-08-14 14:27:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-08-14 14:27:39,729 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:39,729 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-14 14:27:39,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:39,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash 122446423, now seen corresponding path program 1 times [2024-08-14 14:27:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:27:39,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748942803] [2024-08-14 14:27:39,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:39,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:27:39,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:27:39,754 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-14 14:27:39,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-08-14 14:27:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:40,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:27:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:40,346 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:27:40,347 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:27:40,348 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:27:40,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-08-14 14:27:40,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:27:40,555 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:27:40,558 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:27:40,623 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:27:40 BoogieIcfgContainer [2024-08-14 14:27:40,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:27:40,624 INFO L158 Benchmark]: Toolchain (without parser) took 1762.01ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 32.2MB in the beginning and 43.4MB in the end (delta: -11.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-08-14 14:27:40,624 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:40,625 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 60.8MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:40,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.00ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 32.0MB in the beginning and 52.3MB in the end (delta: -20.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-08-14 14:27:40,625 INFO L158 Benchmark]: Boogie Preprocessor took 51.90ms. Allocated memory is still 75.5MB. Free memory was 52.2MB in the beginning and 50.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:27:40,625 INFO L158 Benchmark]: IcfgBuilder took 306.83ms. Allocated memory is still 75.5MB. Free memory was 49.7MB in the beginning and 35.7MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:27:40,626 INFO L158 Benchmark]: TraceAbstraction took 1156.55ms. Allocated memory is still 75.5MB. Free memory was 35.0MB in the beginning and 43.4MB in the end (delta: -8.3MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-08-14 14:27:40,627 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.64ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.18ms. Allocated memory is still 60.8MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.00ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 32.0MB in the beginning and 52.3MB in the end (delta: -20.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.90ms. Allocated memory is still 75.5MB. Free memory was 52.2MB in the beginning and 50.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 306.83ms. Allocated memory is still 75.5MB. Free memory was 49.7MB in the beginning and 35.7MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1156.55ms. Allocated memory is still 75.5MB. Free memory was 35.0MB in the beginning and 43.4MB in the end (delta: -8.3MB). Peak memory consumption was 13.6MB. 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.0s, 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=646occurred 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-14 14:27:40,660 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