/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 04:57:14,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 04:57:14,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 04:57:14,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 04:57:14,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 04:57:14,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 04:57:14,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 04:57:14,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 04:57:14,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 04:57:14,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 04:57:14,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 04:57:14,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 04:57:14,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 04:57:14,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 04:57:14,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 04:57:14,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 04:57:14,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 04:57:14,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 04:57:14,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 04:57:14,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 04:57:14,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 04:57:14,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 04:57:14,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 04:57:14,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 04:57:14,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 04:57:14,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 04:57:14,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 04:57:14,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 04:57:14,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 04:57:14,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 04:57:14,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 04:57:14,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 04:57:14,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 04:57:14,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 04:57:14,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 04:57:14,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 04:57:14,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 04:57:14,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 04:57:14,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 04:57:14,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 04:57:14,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 04:57:14,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 04:57:14,981 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 04:57:14,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 04:57:14,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 04:57:14,982 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 04:57:14,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 04:57:14,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 04:57:14,983 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 04:57:14,983 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 04:57:14,983 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 04:57:14,983 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 04:57:14,984 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 04:57:14,984 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 04:57:14,984 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 04:57:14,984 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 04:57:14,984 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 04:57:14,984 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 04:57:14,984 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 04:57:14,984 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 04:57:14,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 04:57:14,985 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 04:57:14,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 04:57:14,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 04:57:14,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 04:57:14,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 04:57:14,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 04:57:14,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 04:57:14,986 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 04:57:14,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 04:57:14,986 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 04:57:14,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 04:57:14,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 04:57:14,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 04:57:14,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 04:57:14,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 04:57:14,987 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 04:57:14,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 04:57:14,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 04:57:14,987 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 04:57:14,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 04:57:14,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 04:57:14,988 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 04:57:14,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.sifa: Abstract Domain -> OctagonDomain [2023-04-01 04:57:15,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 04:57:15,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 04:57:15,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 04:57:15,278 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 04:57:15,278 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 04:57:15,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-04-01 04:57:16,495 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 04:57:16,731 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 04:57:16,731 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-04-01 04:57:16,741 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972e3da3a/32e033427674459f8beb2c28d7679ae4/FLAG933728987 [2023-04-01 04:57:16,754 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972e3da3a/32e033427674459f8beb2c28d7679ae4 [2023-04-01 04:57:16,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 04:57:16,757 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 04:57:16,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 04:57:16,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 04:57:16,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 04:57:16,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 04:57:16" (1/1) ... [2023-04-01 04:57:16,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31141800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:16, skipping insertion in model container [2023-04-01 04:57:16,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 04:57:16" (1/1) ... [2023-04-01 04:57:16,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 04:57:16,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 04:57:17,024 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-04-01 04:57:17,028 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 04:57:17,044 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 04:57:17,107 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-04-01 04:57:17,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 04:57:17,137 INFO L208 MainTranslator]: Completed translation [2023-04-01 04:57:17,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17 WrapperNode [2023-04-01 04:57:17,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 04:57:17,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 04:57:17,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 04:57:17,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 04:57:17,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17" (1/1) ... [2023-04-01 04:57:17,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17" (1/1) ... [2023-04-01 04:57:17,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17" (1/1) ... [2023-04-01 04:57:17,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17" (1/1) ... [2023-04-01 04:57:17,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17" (1/1) ... [2023-04-01 04:57:17,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17" (1/1) ... [2023-04-01 04:57:17,207 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17" (1/1) ... [2023-04-01 04:57:17,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17" (1/1) ... [2023-04-01 04:57:17,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 04:57:17,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 04:57:17,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 04:57:17,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 04:57:17,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17" (1/1) ... [2023-04-01 04:57:17,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 04:57:17,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:57:17,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 04:57:17,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 04:57:17,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 04:57:17,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 04:57:17,286 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 04:57:17,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-01 04:57:17,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-01 04:57:17,287 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-01 04:57:17,287 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2023-04-01 04:57:17,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 04:57:17,287 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 04:57:17,287 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 04:57:17,287 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-01 04:57:17,287 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-01 04:57:17,287 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 04:57:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 04:57:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-01 04:57:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-01 04:57:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-01 04:57:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-01 04:57:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-01 04:57:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-01 04:57:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-01 04:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-01 04:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-01 04:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-01 04:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-01 04:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-01 04:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-01 04:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-01 04:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-01 04:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-01 04:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-01 04:57:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-01 04:57:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-01 04:57:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-01 04:57:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-01 04:57:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-01 04:57:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-01 04:57:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-01 04:57:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-01 04:57:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-01 04:57:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-01 04:57:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-01 04:57:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-01 04:57:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-01 04:57:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-01 04:57:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-01 04:57:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-01 04:57:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-01 04:57:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-01 04:57:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-01 04:57:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-01 04:57:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-01 04:57:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-01 04:57:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-01 04:57:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-01 04:57:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-01 04:57:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-01 04:57:17,293 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-01 04:57:17,293 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-01 04:57:17,294 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-01 04:57:17,294 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-01 04:57:17,294 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-01 04:57:17,294 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-01 04:57:17,294 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-01 04:57:17,294 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-01 04:57:17,295 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-01 04:57:17,296 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 04:57:17,296 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-01 04:57:17,296 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-01 04:57:17,296 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-01 04:57:17,296 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-01 04:57:17,296 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-01 04:57:17,296 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-01 04:57:17,296 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-01 04:57:17,296 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-01 04:57:17,297 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-01 04:57:17,298 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-01 04:57:17,298 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-01 04:57:17,298 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-01 04:57:17,298 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-01 04:57:17,298 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-01 04:57:17,298 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-01 04:57:17,298 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-01 04:57:17,298 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-01 04:57:17,298 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-01 04:57:17,298 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-01 04:57:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-01 04:57:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-01 04:57:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-01 04:57:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-01 04:57:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-01 04:57:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-01 04:57:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-01 04:57:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-01 04:57:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-01 04:57:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2023-04-01 04:57:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 04:57:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-01 04:57:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 04:57:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 04:57:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 04:57:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-01 04:57:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 04:57:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 04:57:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 04:57:17,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 04:57:17,496 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 04:57:17,498 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 04:57:17,538 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-01 04:57:17,685 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 04:57:17,723 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 04:57:17,724 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-01 04:57:17,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 04:57:17 BoogieIcfgContainer [2023-04-01 04:57:17,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 04:57:17,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 04:57:17,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 04:57:17,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 04:57:17,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 04:57:16" (1/3) ... [2023-04-01 04:57:17,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec2e8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 04:57:17, skipping insertion in model container [2023-04-01 04:57:17,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:57:17" (2/3) ... [2023-04-01 04:57:17,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec2e8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 04:57:17, skipping insertion in model container [2023-04-01 04:57:17,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 04:57:17" (3/3) ... [2023-04-01 04:57:17,738 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-04-01 04:57:17,757 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 04:57:17,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 04:57:17,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 04:57:17,805 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@19ec3529, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 04:57:17,806 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 04:57:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 24 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 04:57:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-01 04:57:17,816 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:57:17,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:57:17,818 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:57:17,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:57:17,823 INFO L85 PathProgramCache]: Analyzing trace with hash 665924706, now seen corresponding path program 1 times [2023-04-01 04:57:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:57:17,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634758374] [2023-04-01 04:57:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:17,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:57:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:57:18,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:57:18,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634758374] [2023-04-01 04:57:18,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634758374] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:57:18,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:57:18,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 04:57:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845288784] [2023-04-01 04:57:18,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:57:18,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 04:57:18,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:57:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 04:57:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 04:57:18,248 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 24 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:57:18,317 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2023-04-01 04:57:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 04:57:18,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-04-01 04:57:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:57:18,326 INFO L225 Difference]: With dead ends: 52 [2023-04-01 04:57:18,327 INFO L226 Difference]: Without dead ends: 26 [2023-04-01 04:57:18,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 04:57:18,333 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:57:18,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 101 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:57:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-04-01 04:57:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-04-01 04:57:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-04-01 04:57:18,379 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2023-04-01 04:57:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:57:18,382 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-04-01 04:57:18,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-04-01 04:57:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-01 04:57:18,383 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:57:18,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:57:18,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 04:57:18,384 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:57:18,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:57:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1143184170, now seen corresponding path program 1 times [2023-04-01 04:57:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:57:18,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862341525] [2023-04-01 04:57:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:57:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:57:18,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:57:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862341525] [2023-04-01 04:57:18,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862341525] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:57:18,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388762069] [2023-04-01 04:57:18,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:18,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:57:18,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:57:18,549 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) [2023-04-01 04:57:18,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 04:57:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:18,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 04:57:18,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:57:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:57:18,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:57:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:57:18,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388762069] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:57:18,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1021814715] [2023-04-01 04:57:18,998 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-01 04:57:18,998 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:57:19,002 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:57:19,006 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:57:19,008 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:57:19,099 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:57:19,563 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 29 for LOIs [2023-04-01 04:57:19,939 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:57:19,943 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:57:20,562 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '262#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| main_~ptr~0.base) 4) 1)) (= main_~ptr~0.offset 0) (= main_~head~1.base main_~ptr~0.base) (= 5 main_~len~0) (= |#NULL.offset| 0) (= main_~data_new~0 1) (= main_~data_init~0 1) (= 0 main_~head~1.offset) (= |#NULL.base| 0) (<= (+ main_~head~1.base 1) |#StackHeapBarrier|))' at error location [2023-04-01 04:57:20,562 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:57:20,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:57:20,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-04-01 04:57:20,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353347122] [2023-04-01 04:57:20,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:57:20,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 04:57:20,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:57:20,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 04:57:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2023-04-01 04:57:20,566 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 9 states, 6 states have (on average 3.5) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 04:57:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:57:20,606 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-04-01 04:57:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 04:57:20,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.5) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 18 [2023-04-01 04:57:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:57:20,607 INFO L225 Difference]: With dead ends: 40 [2023-04-01 04:57:20,607 INFO L226 Difference]: Without dead ends: 29 [2023-04-01 04:57:20,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2023-04-01 04:57:20,610 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:57:20,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 47 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:57:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-01 04:57:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-04-01 04:57:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-04-01 04:57:20,619 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2023-04-01 04:57:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:57:20,620 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-04-01 04:57:20,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.5) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 04:57:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-04-01 04:57:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 04:57:20,621 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:57:20,622 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:57:20,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 04:57:20,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:57:20,829 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:57:20,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:57:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1456840862, now seen corresponding path program 2 times [2023-04-01 04:57:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:57:20,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036112139] [2023-04-01 04:57:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:57:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:57:21,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:57:21,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036112139] [2023-04-01 04:57:21,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036112139] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:57:21,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719866821] [2023-04-01 04:57:21,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 04:57:21,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:57:21,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:57:21,019 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) [2023-04-01 04:57:21,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 04:57:21,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 04:57:21,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:57:21,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 04:57:21,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:57:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:57:21,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:57:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:57:21,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719866821] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:57:21,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [60636688] [2023-04-01 04:57:21,327 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-01 04:57:21,327 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:57:21,328 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:57:21,328 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:57:21,328 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:57:21,354 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:57:21,604 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 29 for LOIs [2023-04-01 04:57:21,842 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:57:21,845 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:57:22,415 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '507#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| main_~ptr~0.base) 4) 1)) (= main_~ptr~0.offset 0) (= main_~head~1.base main_~ptr~0.base) (= 5 main_~len~0) (= |#NULL.offset| 0) (= main_~data_new~0 1) (= main_~data_init~0 1) (= 0 main_~head~1.offset) (= |#NULL.base| 0) (<= (+ main_~head~1.base 1) |#StackHeapBarrier|))' at error location [2023-04-01 04:57:22,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:57:22,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:57:22,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-04-01 04:57:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857705198] [2023-04-01 04:57:22,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:57:22,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 04:57:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:57:22,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 04:57:22,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2023-04-01 04:57:22,418 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 04:57:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:57:22,468 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-04-01 04:57:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 04:57:22,469 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2023-04-01 04:57:22,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:57:22,470 INFO L225 Difference]: With dead ends: 43 [2023-04-01 04:57:22,470 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 04:57:22,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2023-04-01 04:57:22,471 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:57:22,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 79 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:57:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 04:57:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-04-01 04:57:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-04-01 04:57:22,476 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2023-04-01 04:57:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:57:22,476 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-04-01 04:57:22,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 04:57:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-04-01 04:57:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-01 04:57:22,477 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:57:22,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:57:22,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-01 04:57:22,684 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,SelfDestructingSolverStorable2 [2023-04-01 04:57:22,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:57:22,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:57:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash 932614186, now seen corresponding path program 3 times [2023-04-01 04:57:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:57:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433282708] [2023-04-01 04:57:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:57:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:57:22,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:57:22,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433282708] [2023-04-01 04:57:22,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433282708] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:57:22,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649647501] [2023-04-01 04:57:22,838 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 04:57:22,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:57:22,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:57:22,841 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) [2023-04-01 04:57:22,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 04:57:22,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 04:57:22,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:57:22,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-01 04:57:22,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:57:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:57:23,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:57:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:57:23,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649647501] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:57:23,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1739224266] [2023-04-01 04:57:23,130 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-01 04:57:23,130 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:57:23,130 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:57:23,131 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:57:23,131 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:57:23,144 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:57:23,280 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 29 for LOIs [2023-04-01 04:57:23,497 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:57:23,500 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:57:24,039 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '779#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| main_~ptr~0.base) 4) 1)) (= main_~ptr~0.offset 0) (= main_~head~1.base main_~ptr~0.base) (= 5 main_~len~0) (= |#NULL.offset| 0) (= main_~data_new~0 1) (= main_~data_init~0 1) (= 0 main_~head~1.offset) (= |#NULL.base| 0) (<= (+ main_~head~1.base 1) |#StackHeapBarrier|))' at error location [2023-04-01 04:57:24,039 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:57:24,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:57:24,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2023-04-01 04:57:24,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126727078] [2023-04-01 04:57:24,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:57:24,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 04:57:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:57:24,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 04:57:24,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-04-01 04:57:24,042 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:57:24,112 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-04-01 04:57:24,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 04:57:24,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-04-01 04:57:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:57:24,113 INFO L225 Difference]: With dead ends: 46 [2023-04-01 04:57:24,113 INFO L226 Difference]: Without dead ends: 35 [2023-04-01 04:57:24,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2023-04-01 04:57:24,114 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:57:24,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 126 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:57:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-04-01 04:57:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2023-04-01 04:57:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-04-01 04:57:24,118 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 24 [2023-04-01 04:57:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:57:24,119 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-04-01 04:57:24,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-04-01 04:57:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-01 04:57:24,120 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:57:24,120 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:57:24,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 04:57:24,326 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 [2023-04-01 04:57:24,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:57:24,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:57:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash 399985250, now seen corresponding path program 4 times [2023-04-01 04:57:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:57:24,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044867506] [2023-04-01 04:57:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:57:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 04:57:25,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:57:25,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044867506] [2023-04-01 04:57:25,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044867506] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:57:25,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889015848] [2023-04-01 04:57:25,065 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 04:57:25,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:57:25,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:57:25,066 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) [2023-04-01 04:57:25,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 04:57:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:25,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 37 conjunts are in the unsatisfiable core [2023-04-01 04:57:25,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:57:25,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-01 04:57:25,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:57:25,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-04-01 04:57:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 04:57:25,447 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:57:25,567 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 04:57:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 04:57:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889015848] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:57:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [55672582] [2023-04-01 04:57:25,732 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-01 04:57:25,732 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:57:25,732 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:57:25,732 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:57:25,732 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:57:25,746 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:57:25,926 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 29 for LOIs [2023-04-01 04:57:26,131 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:57:26,134 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:57:26,853 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1091#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| main_~ptr~0.base) 4) 1)) (= main_~ptr~0.offset 0) (= main_~head~1.base main_~ptr~0.base) (= 5 main_~len~0) (= |#NULL.offset| 0) (= main_~data_new~0 1) (= main_~data_init~0 1) (= 0 main_~head~1.offset) (= |#NULL.base| 0) (<= (+ main_~head~1.base 1) |#StackHeapBarrier|))' at error location [2023-04-01 04:57:26,853 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:57:26,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:57:26,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 26 [2023-04-01 04:57:26,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186893436] [2023-04-01 04:57:26,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:57:26,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-01 04:57:26,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:57:26,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-01 04:57:26,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1484, Unknown=0, NotChecked=0, Total=1640 [2023-04-01 04:57:26,857 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 26 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 04:57:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:57:27,224 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-04-01 04:57:27,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 04:57:27,224 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2023-04-01 04:57:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:57:27,225 INFO L225 Difference]: With dead ends: 37 [2023-04-01 04:57:27,225 INFO L226 Difference]: Without dead ends: 35 [2023-04-01 04:57:27,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=2021, Unknown=0, NotChecked=0, Total=2256 [2023-04-01 04:57:27,227 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 04:57:27,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 185 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 04:57:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-04-01 04:57:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-04-01 04:57:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-04-01 04:57:27,232 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 27 [2023-04-01 04:57:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:57:27,233 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-04-01 04:57:27,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 04:57:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-04-01 04:57:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-01 04:57:27,234 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:57:27,234 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:57:27,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 04:57:27,441 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 [2023-04-01 04:57:27,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:57:27,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:57:27,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1722249148, now seen corresponding path program 1 times [2023-04-01 04:57:27,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:57:27,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411159105] [2023-04-01 04:57:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:27,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:57:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 04:57:28,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:57:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411159105] [2023-04-01 04:57:28,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411159105] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:57:28,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927508293] [2023-04-01 04:57:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:28,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:57:28,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:57:28,880 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) [2023-04-01 04:57:28,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 04:57:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:29,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 73 conjunts are in the unsatisfiable core [2023-04-01 04:57:29,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:57:29,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 04:57:29,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-04-01 04:57:29,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-04-01 04:57:29,228 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-04-01 04:57:29,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-04-01 04:57:29,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-01 04:57:29,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-04-01 04:57:29,300 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-01 04:57:29,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-04-01 04:57:29,314 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-04-01 04:57:29,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-04-01 04:57:29,591 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:57:29,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2023-04-01 04:57:29,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:57:29,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2023-04-01 04:57:29,622 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-01 04:57:29,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 31 [2023-04-01 04:57:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 04:57:29,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:57:30,161 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 04:57:30,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2023-04-01 04:57:30,227 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_569 Int) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.offset)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset))) (or (= .cse0 c_sll_circular_create_~head~0.offset) (= (select (select (store (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569)) c_sll_circular_create_~head~0.base v_ArrVal_577) (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.base)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset)) (+ .cse0 4)) |c_sll_circular_create_#in~data|)))) (forall ((v_ArrVal_569 Int) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.base)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset))) (or (= c_sll_circular_create_~head~0.base .cse1) (= (select (select (store (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569)) c_sll_circular_create_~head~0.base v_ArrVal_577) .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.offset)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset) 4)) |c_sll_circular_create_#in~data|))))) is different from false [2023-04-01 04:57:30,519 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_sll_circular_create_~new_head~0.offset c_sll_circular_create_~last~0.offset)) (.cse2 (+ c_sll_circular_create_~new_head~0.offset 4)) (.cse3 (+ c_sll_circular_create_~head~0.offset 4))) (and (or .cse0 (and (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (let ((.cse1 (select (store (let ((.cse4 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse4 sll_circular_create_~last~0.base (store (select .cse4 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse1 .cse2) |c_sll_circular_create_#in~data|) (= (select .cse1 .cse3) |c_sll_circular_create_#in~data|)))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (= (select (select (store (let ((.cse5 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse5 sll_circular_create_~last~0.base (store (select .cse5 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base) .cse3) |c_sll_circular_create_#in~data|)) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (let ((.cse6 (select (store (let ((.cse7 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse7 sll_circular_create_~last~0.base (store (select .cse7 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse6 .cse2) |c_sll_circular_create_#in~data|) (= (select .cse6 .cse3) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_577 .cse2) |c_sll_circular_create_#in~data|)))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (let ((.cse8 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse8 sll_circular_create_~last~0.base (store (select .cse8 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base) .cse3) |c_sll_circular_create_#in~data|)))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (or (= c_sll_circular_create_~head~0.offset c_sll_circular_create_~new_head~0.offset) (and (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse10 sll_circular_create_~last~0.base (store (select .cse10 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse9 .cse2) |c_sll_circular_create_#in~data|) (= (select .cse9 .cse3) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_577 .cse2) |c_sll_circular_create_#in~data|)))) (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (let ((.cse11 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse11 sll_circular_create_~last~0.base (store (select .cse11 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base) .cse3) |c_sll_circular_create_#in~data|)))) (or .cse0 (and (forall ((sll_circular_create_~new_head~0.base Int) (v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse13 sll_circular_create_~last~0.base (store (select .cse13 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse12 .cse2) |c_sll_circular_create_#in~data|) (= (select .cse12 .cse3) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_577 .cse2) |c_sll_circular_create_#in~data|)))) (forall ((sll_circular_create_~new_head~0.base Int) (v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse15 sll_circular_create_~last~0.base (store (select .cse15 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse14 .cse2) |c_sll_circular_create_#in~data|) (= (select .cse14 .cse3) |c_sll_circular_create_#in~data|)))) (forall ((sll_circular_create_~new_head~0.base Int) (v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (= (select (select (store (let ((.cse16 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse16 sll_circular_create_~last~0.base (store (select .cse16 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base) .cse3) |c_sll_circular_create_#in~data|)))) (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse18 sll_circular_create_~last~0.base (store (select .cse18 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse17 .cse2) |c_sll_circular_create_#in~data|) (= (select .cse17 .cse3) |c_sll_circular_create_#in~data|)))))))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse20 sll_circular_create_~last~0.base (store (select .cse20 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse19 .cse2) |c_sll_circular_create_#in~data|) (= (select .cse19 .cse3) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_577 .cse2) |c_sll_circular_create_#in~data|)))) (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse22 sll_circular_create_~last~0.base (store (select .cse22 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse21 .cse2) |c_sll_circular_create_#in~data|) (= (select .cse21 .cse3) |c_sll_circular_create_#in~data|)))))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))))) is different from false [2023-04-01 04:57:30,859 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_sll_circular_create_~head~0.offset 4)) (.cse11 (= c_sll_circular_create_~last~0.offset 0))) (and (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse0 sll_circular_create_~last~0.base (store (select .cse0 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (let ((.cse2 (select (store (let ((.cse3 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse3 sll_circular_create_~last~0.base (store (select .cse3 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse2 4) |c_sll_circular_create_#in~data|) (= (select .cse2 .cse1) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_577 4) |c_sll_circular_create_#in~data|)))))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (let ((.cse4 (select (store (let ((.cse5 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse5 sll_circular_create_~last~0.base (store (select .cse5 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse4 4) |c_sll_circular_create_#in~data|) (= (select .cse4 .cse1) |c_sll_circular_create_#in~data|)))))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (or (and (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (let ((.cse6 (select (store (let ((.cse7 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse7 sll_circular_create_~last~0.base (store (select .cse7 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse6 4) |c_sll_circular_create_#in~data|) (= (select .cse6 .cse1) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_577 4) |c_sll_circular_create_#in~data|)))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse9 sll_circular_create_~last~0.base (store (select .cse9 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse8 4) |c_sll_circular_create_#in~data|) (= (select .cse8 .cse1) |c_sll_circular_create_#in~data|)))) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base))) (forall ((sll_circular_create_~new_head~0.base Int)) (or (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (= (select (select (store (let ((.cse10 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse10 sll_circular_create_~last~0.base (store (select .cse10 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)) (= c_sll_circular_create_~head~0.base sll_circular_create_~new_head~0.base)))) .cse11) (or (= c_sll_circular_create_~head~0.offset 0) (and (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse13 sll_circular_create_~last~0.base (store (select .cse13 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse12 4) |c_sll_circular_create_#in~data|) (= (select .cse12 .cse1) |c_sll_circular_create_#in~data|)))))) (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse15 sll_circular_create_~last~0.base (store (select .cse15 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse14 4) |c_sll_circular_create_#in~data|) (= (select .cse14 .cse1) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_577 4) |c_sll_circular_create_#in~data|)))))) (forall ((sll_circular_create_~new_head~0.base Int) (sll_circular_create_~last~0.base Int)) (or (= sll_circular_create_~last~0.base sll_circular_create_~new_head~0.base) (forall ((v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (let ((.cse16 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse16 sll_circular_create_~last~0.base (store (select .cse16 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)))) (or (and (forall ((sll_circular_create_~new_head~0.base Int) (v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse18 sll_circular_create_~last~0.base (store (select .cse18 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse17 4) |c_sll_circular_create_#in~data|) (= (select .cse17 .cse1) |c_sll_circular_create_#in~data|) (= (select v_ArrVal_577 4) |c_sll_circular_create_#in~data|)))) (forall ((sll_circular_create_~new_head~0.base Int) (v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (= (select (select (store (let ((.cse19 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse19 sll_circular_create_~last~0.base (store (select .cse19 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base) .cse1) |c_sll_circular_create_#in~data|)) (forall ((sll_circular_create_~new_head~0.base Int) (v_ArrVal_569 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (sll_circular_create_~last~0.base Int)) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_566))) (store .cse21 sll_circular_create_~last~0.base (store (select .cse21 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_ArrVal_569))) sll_circular_create_~new_head~0.base v_ArrVal_577) c_sll_circular_create_~head~0.base))) (or (= (select .cse20 4) |c_sll_circular_create_#in~data|) (= (select .cse20 .cse1) |c_sll_circular_create_#in~data|))))) .cse11))))) is different from false [2023-04-01 04:57:30,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:57:30,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2023-04-01 04:57:30,993 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 04:57:30,993 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 04:57:31,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:57:31,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 65 [2023-04-01 04:57:31,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:57:31,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 73 [2023-04-01 04:57:31,086 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-01 04:57:31,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-04-01 04:57:31,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:57:31,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2023-04-01 04:57:31,103 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 04:57:31,112 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-04-01 04:57:31,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 258 [2023-04-01 04:57:31,123 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 04:57:31,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2023-04-01 04:57:31,128 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 04:57:31,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-04-01 04:57:31,139 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 04:57:31,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 1 [2023-04-01 04:57:31,146 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 04:57:31,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 1 [2023-04-01 04:57:31,153 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 04:57:31,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 1 [2023-04-01 04:57:31,162 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 04:57:31,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 1 [2023-04-01 04:57:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 13 not checked. [2023-04-01 04:57:31,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927508293] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:57:31,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [287567703] [2023-04-01 04:57:31,260 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 04:57:31,260 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:57:31,260 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:57:31,260 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:57:31,260 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:57:31,277 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:57:31,450 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 29 for LOIs [2023-04-01 04:57:31,662 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:57:31,664 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:57:32,452 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1438#(and (<= 1 |#StackHeapBarrier|) (<= 1 main_~data_new~0) (= 5 main_~len~0) (= |#NULL.offset| 0) (= main_~data_init~0 1) (= 0 main_~head~1.offset) (= |#NULL.base| 0) (<= (+ main_~head~1.base 1) |#StackHeapBarrier|))' at error location [2023-04-01 04:57:32,452 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:57:32,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:57:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 13] total 38 [2023-04-01 04:57:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902365142] [2023-04-01 04:57:32,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:57:32,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-04-01 04:57:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:57:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-04-01 04:57:32,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2174, Unknown=3, NotChecked=288, Total=2652 [2023-04-01 04:57:32,456 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 38 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 35 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 04:57:33,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:57:33,944 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-04-01 04:57:33,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 04:57:33,944 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 35 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-04-01 04:57:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:57:33,946 INFO L225 Difference]: With dead ends: 49 [2023-04-01 04:57:33,946 INFO L226 Difference]: Without dead ends: 47 [2023-04-01 04:57:33,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=320, Invalid=3111, Unknown=3, NotChecked=348, Total=3782 [2023-04-01 04:57:33,948 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 58 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 04:57:33,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 173 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 450 Invalid, 0 Unknown, 120 Unchecked, 0.5s Time] [2023-04-01 04:57:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-04-01 04:57:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2023-04-01 04:57:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-04-01 04:57:33,954 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2023-04-01 04:57:33,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:57:33,954 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-04-01 04:57:33,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 35 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 04:57:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-04-01 04:57:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 04:57:33,955 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:57:33,955 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:57:33,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-01 04:57:34,156 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 [2023-04-01 04:57:34,156 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:57:34,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:57:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1848730679, now seen corresponding path program 1 times [2023-04-01 04:57:34,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:57:34,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993888739] [2023-04-01 04:57:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:34,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:57:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 04:57:34,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:57:34,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993888739] [2023-04-01 04:57:34,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993888739] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:57:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130941419] [2023-04-01 04:57:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:34,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:57:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:57:34,625 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:57:34,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 04:57:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:34,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 49 conjunts are in the unsatisfiable core [2023-04-01 04:57:34,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:57:34,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-01 04:57:34,835 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-01 04:57:34,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-01 04:57:34,852 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-01 04:57:34,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-01 04:57:34,865 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-01 04:57:34,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-04-01 04:57:34,908 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-04-01 04:57:34,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-04-01 04:57:34,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-04-01 04:57:34,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-04-01 04:57:34,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-04-01 04:57:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 04:57:34,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:57:35,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:57:35,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-04-01 04:57:35,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-04-01 04:57:35,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-04-01 04:57:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 04:57:35,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130941419] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:57:35,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1651034714] [2023-04-01 04:57:35,248 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-01 04:57:35,248 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:57:35,248 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:57:35,248 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:57:35,248 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:57:35,261 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:57:35,409 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 29 for LOIs [2023-04-01 04:57:35,638 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:57:35,641 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:57:36,590 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1804#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| main_~head~1.base) 0) 0) (= main_~ptr~0.offset 0) (= main_~head~1.base main_~ptr~0.base) (= 5 main_~len~0) (exists ((|v_#memory_int_231| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_int_231| main_~head~1.base) 4) 1) (= |#memory_int| (store |v_#memory_int_231| main_~head~1.base (store (select |v_#memory_int_231| main_~head~1.base) 4 1))))) (= (select (select |#memory_$Pointer$.base| main_~head~1.base) 0) main_~ptr~0.base) (= (+ main_~data_new~0 3) 0) (= |#NULL.offset| 0) (= main_~data_init~0 1) (= 0 main_~head~1.offset) (= |#NULL.base| 0) (<= (+ main_~head~1.base 1) |#StackHeapBarrier|))' at error location [2023-04-01 04:57:36,590 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:57:36,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:57:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 23 [2023-04-01 04:57:36,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835269240] [2023-04-01 04:57:36,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:57:36,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 04:57:36,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:57:36,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 04:57:36,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1505, Unknown=5, NotChecked=0, Total=1640 [2023-04-01 04:57:36,594 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 23 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 04:57:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:57:36,802 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2023-04-01 04:57:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 04:57:36,803 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-04-01 04:57:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:57:36,804 INFO L225 Difference]: With dead ends: 44 [2023-04-01 04:57:36,804 INFO L226 Difference]: Without dead ends: 38 [2023-04-01 04:57:36,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=1782, Unknown=5, NotChecked=0, Total=1980 [2023-04-01 04:57:36,805 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:57:36,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 182 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:57:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-04-01 04:57:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-04-01 04:57:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:57:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-04-01 04:57:36,812 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 31 [2023-04-01 04:57:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:57:36,812 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-04-01 04:57:36,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 04:57:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-04-01 04:57:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-01 04:57:36,813 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:57:36,813 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:57:36,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 04:57:37,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:57:37,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:57:37,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:57:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash -154004446, now seen corresponding path program 2 times [2023-04-01 04:57:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:57:37,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997916962] [2023-04-01 04:57:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:37,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:57:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 04:57:38,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:57:38,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997916962] [2023-04-01 04:57:38,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997916962] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:57:38,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451377379] [2023-04-01 04:57:38,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 04:57:38,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:57:38,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:57:38,733 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:57:38,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 04:57:39,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 04:57:39,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:57:39,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 113 conjunts are in the unsatisfiable core [2023-04-01 04:57:39,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:57:39,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-01 04:57:39,282 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-01 04:57:39,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-04-01 04:57:39,311 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-01 04:57:39,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-01 04:57:39,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 04:57:39,358 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-04-01 04:57:39,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-04-01 04:57:39,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-04-01 04:57:39,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-04-01 04:57:39,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-04-01 04:57:39,551 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-01 04:57:39,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-04-01 04:57:39,564 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-04-01 04:57:39,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2023-04-01 04:57:39,581 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-01 04:57:39,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-04-01 04:57:39,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-01 04:57:39,722 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-04-01 04:57:39,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 88 [2023-04-01 04:57:39,751 INFO L321 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-04-01 04:57:39,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 80 [2023-04-01 04:57:39,767 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-04-01 04:57:39,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2023-04-01 04:57:40,656 INFO L321 Elim1Store]: treesize reduction 54, result has 64.9 percent of original size [2023-04-01 04:57:40,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 220 treesize of output 300 [2023-04-01 04:57:40,674 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2023-04-01 04:57:40,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 297 treesize of output 210 [2023-04-01 04:57:40,698 INFO L321 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2023-04-01 04:57:40,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 214 treesize of output 228 [2023-04-01 04:57:45,205 INFO L321 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-04-01 04:57:45,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 127 [2023-04-01 04:57:45,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:57:45,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 94 [2023-04-01 04:57:45,252 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-01 04:57:45,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2023-04-01 04:57:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 04:57:45,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:57:46,492 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 04:57:46,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2125 treesize of output 1 [2023-04-01 04:57:59,544 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((sll_circular_create_~new_head~0.base Int) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_945 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_955 Int) (v_ArrVal_943 Int) (v_ArrVal_951 (Array Int Int))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.base| sll_circular_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.base| sll_circular_create_~new_head~0.base) 0 c_sll_circular_create_~head~0.base) 4 v_ArrVal_945)))) (store .cse8 c_sll_circular_create_~last~0.base (store (select .cse8 c_sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset sll_circular_create_~new_head~0.base)))) (.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.offset| sll_circular_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~new_head~0.base) 0 c_sll_circular_create_~head~0.offset) 4 v_ArrVal_943)))) (store .cse7 c_sll_circular_create_~last~0.base (store (select .cse7 c_sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset 0))))) (let ((.cse3 (select .cse2 sll_circular_create_~new_head~0.base)) (.cse6 (select .cse5 sll_circular_create_~new_head~0.base))) (let ((.cse0 (select .cse6 0)) (.cse4 (select .cse3 0))) (let ((.cse1 (select (select (store .cse5 sll_circular_create_~new_head~0.base (store .cse6 4 v_ArrVal_955)) .cse0) .cse4))) (or (= |c_sll_circular_create_#in~data| (select (select (store (store (store (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_948) c_sll_circular_create_~last~0.base v_ArrVal_951) sll_circular_create_~new_head~0.base v_ArrVal_957) .cse0 v_ArrVal_960) .cse1) (+ (select (select (store .cse2 sll_circular_create_~new_head~0.base (store .cse3 4 v_ArrVal_958)) .cse0) .cse4) 4))) (= .cse1 sll_circular_create_~new_head~0.base))))))) (forall ((sll_circular_create_~new_head~0.base Int) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_945 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_955 Int) (v_ArrVal_943 Int) (v_ArrVal_951 (Array Int Int))) (let ((.cse10 (let ((.cse17 (store |c_#memory_$Pointer$.base| sll_circular_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.base| sll_circular_create_~new_head~0.base) 0 c_sll_circular_create_~head~0.base) 4 v_ArrVal_945)))) (store .cse17 c_sll_circular_create_~last~0.base (store (select .cse17 c_sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset sll_circular_create_~new_head~0.base)))) (.cse14 (let ((.cse16 (store |c_#memory_$Pointer$.offset| sll_circular_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~new_head~0.base) 0 c_sll_circular_create_~head~0.offset) 4 v_ArrVal_943)))) (store .cse16 c_sll_circular_create_~last~0.base (store (select .cse16 c_sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset 0))))) (let ((.cse15 (select .cse14 sll_circular_create_~new_head~0.base)) (.cse11 (select .cse10 sll_circular_create_~new_head~0.base))) (let ((.cse9 (select .cse11 0)) (.cse12 (select .cse15 0))) (let ((.cse13 (select (select (store .cse14 sll_circular_create_~new_head~0.base (store .cse15 4 v_ArrVal_958)) .cse9) .cse12))) (or (= |c_sll_circular_create_#in~data| (select (select (store (store (store (store |c_#memory_int| sll_circular_create_~new_head~0.base v_ArrVal_948) c_sll_circular_create_~last~0.base v_ArrVal_951) sll_circular_create_~new_head~0.base v_ArrVal_957) .cse9 v_ArrVal_960) (select (select (store .cse10 sll_circular_create_~new_head~0.base (store .cse11 4 v_ArrVal_955)) .cse9) .cse12)) (+ .cse13 4))) (= .cse13 0)))))))) is different from false [2023-04-01 04:58:00,076 INFO L321 Elim1Store]: treesize reduction 2493, result has 9.4 percent of original size [2023-04-01 04:58:00,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 248693363 treesize of output 247956258 [2023-04-01 04:58:16,754 WARN L223 SmtUtils]: Spent 16.67s on a formula simplification. DAG size of input: 2189 DAG size of output: 429 (called from [L 809] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)