/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 EqDomain -i ../sv-benchmarks/c/list-simple/sll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 10:58:54,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 10:58:54,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 10:58:54,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 10:58:54,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 10:58:54,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 10:58:54,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 10:58:54,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 10:58:54,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 10:58:54,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 10:58:54,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 10:58:54,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 10:58:54,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 10:58:54,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 10:58:54,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 10:58:54,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 10:58:54,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 10:58:54,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 10:58:54,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 10:58:54,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 10:58:54,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 10:58:54,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 10:58:54,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 10:58:54,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 10:58:54,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 10:58:54,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 10:58:54,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 10:58:54,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 10:58:54,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 10:58:54,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 10:58:54,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 10:58:54,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 10:58:54,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 10:58:54,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 10:58:54,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 10:58:54,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 10:58:54,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 10:58:54,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 10:58:54,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 10:58:54,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 10:58:54,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 10:58:54,256 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 10:58:54,288 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 10:58:54,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 10:58:54,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 10:58:54,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 10:58:54,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 10:58:54,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 10:58:54,293 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 10:58:54,293 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 10:58:54,293 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 10:58:54,293 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 10:58:54,294 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 10:58:54,294 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 10:58:54,294 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 10:58:54,294 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 10:58:54,294 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 10:58:54,295 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 10:58:54,295 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 10:58:54,295 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 10:58:54,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 10:58:54,296 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 10:58:54,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 10:58:54,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 10:58:54,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 10:58:54,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 10:58:54,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 10:58:54,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 10:58:54,297 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 10:58:54,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 10:58:54,297 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 10:58:54,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 10:58:54,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 10:58:54,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 10:58:54,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 10:58:54,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 10:58:54,298 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 10:58:54,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 10:58:54,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 10:58:54,298 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 10:58:54,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 10:58:54,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 10:58:54,298 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 10:58:54,299 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 -> EqDomain [2023-04-01 10:58:54,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 10:58:54,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 10:58:54,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 10:58:54,561 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 10:58:54,562 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 10:58:54,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2023-04-01 10:58:55,713 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 10:58:56,023 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 10:58:56,024 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2023-04-01 10:58:56,040 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ddec15a/97a2d69ca71c40e09d5d7b43b0ac2005/FLAG5326b7b85 [2023-04-01 10:58:56,052 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ddec15a/97a2d69ca71c40e09d5d7b43b0ac2005 [2023-04-01 10:58:56,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 10:58:56,055 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 10:58:56,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 10:58:56,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 10:58:56,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 10:58:56,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f6a537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56, skipping insertion in model container [2023-04-01 10:58:56,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 10:58:56,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 10:58:56,358 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-simple/sll2c_update_all.i[24418,24431] [2023-04-01 10:58:56,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 10:58:56,378 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 10:58:56,415 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-simple/sll2c_update_all.i[24418,24431] [2023-04-01 10:58:56,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 10:58:56,441 INFO L208 MainTranslator]: Completed translation [2023-04-01 10:58:56,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56 WrapperNode [2023-04-01 10:58:56,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 10:58:56,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 10:58:56,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 10:58:56,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 10:58:56,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,501 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 10:58:56,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 10:58:56,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 10:58:56,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 10:58:56,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56" (1/1) ... [2023-04-01 10:58:56,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 10:58:56,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:58:56,541 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 10:58:56,543 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 10:58:56,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 10:58:56,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 10:58:56,573 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 10:58:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-01 10:58:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-01 10:58:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-01 10:58:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-04-01 10:58:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2023-04-01 10:58:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2023-04-01 10:58:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2023-04-01 10:58:56,575 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2023-04-01 10:58:56,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 10:58:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 10:58:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 10:58:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-01 10:58:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-01 10:58:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 10:58:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 10:58:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-01 10:58:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-01 10:58:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-01 10:58:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-01 10:58:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-01 10:58:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-01 10:58:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-01 10:58:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-01 10:58:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-01 10:58:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-01 10:58:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-01 10:58:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-01 10:58:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-01 10:58:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-01 10:58:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-01 10:58:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-01 10:58:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-01 10:58:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-01 10:58:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-01 10:58:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-01 10:58:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-01 10:58:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-01 10:58:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-01 10:58:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-01 10:58:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-01 10:58:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-01 10:58:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-01 10:58:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-01 10:58:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-01 10:58:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-01 10:58:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-01 10:58:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-01 10:58:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-01 10:58:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-01 10:58:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-01 10:58:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-01 10:58:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-01 10:58:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-01 10:58:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-01 10:58:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-01 10:58:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-01 10:58:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-01 10:58:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-01 10:58:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-01 10:58:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-01 10:58:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-01 10:58:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-01 10:58:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-01 10:58:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-01 10:58:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-01 10:58:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-01 10:58:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-01 10:58:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 10:58:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-01 10:58:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-01 10:58:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-01 10:58:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-01 10:58:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-01 10:58:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-01 10:58:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-01 10:58:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-01 10:58:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-01 10:58:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-01 10:58:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-01 10:58:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 10:58:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-01 10:58:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-01 10:58:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-01 10:58:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-01 10:58:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-01 10:58:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-01 10:58:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-01 10:58:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-01 10:58:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-01 10:58:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-01 10:58:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-01 10:58:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-01 10:58:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-01 10:58:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-01 10:58:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-01 10:58:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-01 10:58:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-01 10:58:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-01 10:58:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-01 10:58:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-01 10:58:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-04-01 10:58:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 10:58:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-01 10:58:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 10:58:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2023-04-01 10:58:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2023-04-01 10:58:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-01 10:58:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 10:58:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2023-04-01 10:58:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 10:58:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2023-04-01 10:58:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 10:58:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 10:58:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 10:58:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 10:58:56,828 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 10:58:56,831 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 10:58:56,859 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-01 10:58:57,007 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 10:58:57,046 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 10:58:57,047 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-04-01 10:58:57,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 10:58:57 BoogieIcfgContainer [2023-04-01 10:58:57,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 10:58:57,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 10:58:57,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 10:58:57,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 10:58:57,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 10:58:56" (1/3) ... [2023-04-01 10:58:57,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5948dbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 10:58:57, skipping insertion in model container [2023-04-01 10:58:57,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:58:56" (2/3) ... [2023-04-01 10:58:57,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5948dbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 10:58:57, skipping insertion in model container [2023-04-01 10:58:57,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 10:58:57" (3/3) ... [2023-04-01 10:58:57,057 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2023-04-01 10:58:57,073 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 10:58:57,073 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 10:58:57,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 10:58:57,118 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;@29300652, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 10:58:57,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 10:58:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 10:58:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-01 10:58:57,129 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:58:57,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:58:57,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:58:57,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:58:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash 440507406, now seen corresponding path program 1 times [2023-04-01 10:58:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:58:57,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906758667] [2023-04-01 10:58:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:58:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:58:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:58:57,579 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 10:58:57,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:58:57,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906758667] [2023-04-01 10:58:57,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906758667] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 10:58:57,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 10:58:57,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 10:58:57,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960717837] [2023-04-01 10:58:57,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 10:58:57,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 10:58:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:58:57,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 10:58:57,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 10:58:57,650 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 3 states have (on average 5.333333333333333) internal successors, (16), 5 states have internal predecessors, (16), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 10:58:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:58:57,785 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2023-04-01 10:58:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 10:58:57,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 5.333333333333333) internal successors, (16), 5 states have internal predecessors, (16), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2023-04-01 10:58:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:58:57,795 INFO L225 Difference]: With dead ends: 78 [2023-04-01 10:58:57,795 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 10:58:57,798 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 10:58:57,803 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 10:58:57,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 147 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 10:58:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 10:58:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2023-04-01 10:58:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 10:58:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-04-01 10:58:57,845 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 25 [2023-04-01 10:58:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:58:57,846 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-04-01 10:58:57,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 5.333333333333333) internal successors, (16), 5 states have internal predecessors, (16), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 10:58:57,846 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-04-01 10:58:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-01 10:58:57,848 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:58:57,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:58:57,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 10:58:57,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:58:57,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:58:57,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1352367643, now seen corresponding path program 1 times [2023-04-01 10:58:57,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:58:57,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828399471] [2023-04-01 10:58:57,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:58:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:58:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:58:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 10:58:58,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:58:58,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828399471] [2023-04-01 10:58:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828399471] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 10:58:58,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 10:58:58,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 10:58:58,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257822836] [2023-04-01 10:58:58,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 10:58:58,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 10:58:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:58:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 10:58:58,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-01 10:58:58,044 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-01 10:58:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:58:58,105 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2023-04-01 10:58:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 10:58:58,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2023-04-01 10:58:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:58:58,106 INFO L225 Difference]: With dead ends: 52 [2023-04-01 10:58:58,107 INFO L226 Difference]: Without dead ends: 43 [2023-04-01 10:58:58,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-01 10:58:58,108 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 10:58:58,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 65 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 10:58:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-04-01 10:58:58,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2023-04-01 10:58:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 10:58:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-04-01 10:58:58,115 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 32 [2023-04-01 10:58:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:58:58,116 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-04-01 10:58:58,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-01 10:58:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-04-01 10:58:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-04-01 10:58:58,120 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:58:58,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:58:58,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 10:58:58,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:58:58,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:58:58,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1217673083, now seen corresponding path program 1 times [2023-04-01 10:58:58,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:58:58,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824511250] [2023-04-01 10:58:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:58:58,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:58:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:58:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 10:58:58,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:58:58,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824511250] [2023-04-01 10:58:58,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824511250] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:58:58,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194396114] [2023-04-01 10:58:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:58:58,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:58:58,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:58:58,323 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 10:58:58,328 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 10:58:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:58:58,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 10:58:58,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:58:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 10:58:58,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 10:58:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 10:58:58,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194396114] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 10:58:58,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [441048725] [2023-04-01 10:58:58,791 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-04-01 10:58:58,791 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 10:58:58,794 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 10:58:58,800 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 10:58:58,800 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 10:58:58,962 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2023-04-01 10:59:00,485 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_update_at with input of size 58 for LOIs [2023-04-01 10:59:00,517 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 53 for LOIs [2023-04-01 10:59:01,013 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 53 for LOIs [2023-04-01 10:59:01,063 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_get_data_at with input of size 59 for LOIs [2023-04-01 10:59:01,127 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 10:59:01,130 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 10:59:03,611 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '605#(and (not (= main_~len~0 0)) (not (= (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) main_~expected~0)) (= main_~i~0 0) (= main_~len~0 main_~expected~0) (<= 0 (+ (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) 2147483648)) (<= (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) 2147483647))' at error location [2023-04-01 10:59:03,611 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 10:59:03,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 10:59:03,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-04-01 10:59:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346889919] [2023-04-01 10:59:03,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 10:59:03,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 10:59:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:03,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 10:59:03,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1340, Unknown=3, NotChecked=0, Total=1482 [2023-04-01 10:59:03,615 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-01 10:59:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:03,687 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2023-04-01 10:59:03,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 10:59:03,688 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 38 [2023-04-01 10:59:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:03,689 INFO L225 Difference]: With dead ends: 54 [2023-04-01 10:59:03,689 INFO L226 Difference]: Without dead ends: 45 [2023-04-01 10:59:03,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=139, Invalid=1340, Unknown=3, NotChecked=0, Total=1482 [2023-04-01 10:59:03,691 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 57 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:03,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 68 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 10:59:03,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-04-01 10:59:03,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2023-04-01 10:59:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 10:59:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-04-01 10:59:03,709 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 38 [2023-04-01 10:59:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:03,709 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-04-01 10:59:03,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-01 10:59:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-04-01 10:59:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-04-01 10:59:03,711 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:03,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:03,723 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 10:59:03,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:03,920 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:03,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash -917576559, now seen corresponding path program 2 times [2023-04-01 10:59:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:03,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525357540] [2023-04-01 10:59:03,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:03,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 10:59:04,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525357540] [2023-04-01 10:59:04,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525357540] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234799070] [2023-04-01 10:59:04,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 10:59:04,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:04,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:04,054 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 10:59:04,057 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 10:59:04,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 10:59:04,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 10:59:04,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 10:59:04,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-01 10:59:04,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 10:59:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234799070] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 10:59:04,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 10:59:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 9 [2023-04-01 10:59:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411971086] [2023-04-01 10:59:04,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 10:59:04,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 10:59:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:04,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 10:59:04,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-04-01 10:59:04,281 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 10:59:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:04,366 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2023-04-01 10:59:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 10:59:04,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2023-04-01 10:59:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:04,369 INFO L225 Difference]: With dead ends: 67 [2023-04-01 10:59:04,369 INFO L226 Difference]: Without dead ends: 58 [2023-04-01 10:59:04,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-01 10:59:04,370 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:04,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 120 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 10:59:04,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-04-01 10:59:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2023-04-01 10:59:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-01 10:59:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2023-04-01 10:59:04,377 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 44 [2023-04-01 10:59:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:04,378 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-04-01 10:59:04,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 10:59:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2023-04-01 10:59:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-04-01 10:59:04,379 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:04,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:04,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 10:59:04,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 10:59:04,587 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:04,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:04,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1948797643, now seen corresponding path program 1 times [2023-04-01 10:59:04,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:04,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658201800] [2023-04-01 10:59:04,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:04,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 10:59:06,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:06,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658201800] [2023-04-01 10:59:06,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658201800] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:06,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503060271] [2023-04-01 10:59:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:06,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:06,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:06,340 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 10:59:06,349 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 10:59:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:06,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 108 conjunts are in the unsatisfiable core [2023-04-01 10:59:06,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:06,594 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 10:59:06,665 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-01 10:59:06,665 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 11 treesize of output 11 [2023-04-01 10:59:06,678 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 10:59:06,723 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-01 10:59:06,724 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-04-01 10:59:06,913 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 10:59:06,969 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 20 treesize of output 19 [2023-04-01 10:59:07,083 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_339 (Array Int Int))) (= (store |c_old(#memory_int)| (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|) v_ArrVal_339) |c_#memory_int|)) is different from true [2023-04-01 10:59:07,097 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 19 treesize of output 11 [2023-04-01 10:59:07,102 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 14 treesize of output 16 [2023-04-01 10:59:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-04-01 10:59:07,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 10:59:07,752 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~s~0.base) c_main_~s~0.offset)) (.cse1 (+ c_main_~s~0.offset 4))) (and (forall ((v_ArrVal_342 (Array Int Int))) (< (select (select (store |c_#memory_int| .cse0 v_ArrVal_342) c_main_~s~0.base) .cse1) (+ c_main_~len~0 1))) (forall ((v_ArrVal_342 (Array Int Int))) (<= c_main_~len~0 (select (select (store |c_#memory_int| .cse0 v_ArrVal_342) c_main_~s~0.base) .cse1))))) is different from false [2023-04-01 10:59:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503060271] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:07,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [360906579] [2023-04-01 10:59:07,757 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-04-01 10:59:07,757 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 10:59:07,757 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 10:59:07,757 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 10:59:07,758 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 10:59:07,790 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2023-04-01 10:59:08,750 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_update_at with input of size 58 for LOIs [2023-04-01 10:59:08,782 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 53 for LOIs [2023-04-01 10:59:09,177 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 53 for LOIs [2023-04-01 10:59:09,226 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_get_data_at with input of size 62 for LOIs [2023-04-01 10:59:09,265 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 10:59:09,269 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 10:59:12,418 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1315#(and (not (= main_~len~0 0)) (not (= (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) main_~expected~0)) (= main_~i~0 0) (= main_~len~0 main_~expected~0) (<= 0 (+ (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) 2147483648)) (<= (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) 2147483647))' at error location [2023-04-01 10:59:12,418 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 10:59:12,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 10:59:12,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 48 [2023-04-01 10:59:12,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396274026] [2023-04-01 10:59:12,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 10:59:12,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-04-01 10:59:12,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:12,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-04-01 10:59:12,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=6190, Unknown=6, NotChecked=318, Total=6806 [2023-04-01 10:59:12,423 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 48 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 9 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2023-04-01 10:59:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:14,026 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2023-04-01 10:59:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-04-01 10:59:14,027 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 9 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) Word has length 45 [2023-04-01 10:59:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:14,028 INFO L225 Difference]: With dead ends: 90 [2023-04-01 10:59:14,029 INFO L226 Difference]: Without dead ends: 88 [2023-04-01 10:59:14,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2666 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=522, Invalid=9970, Unknown=22, NotChecked=406, Total=10920 [2023-04-01 10:59:14,032 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 138 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 64 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:14,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 302 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1417 Invalid, 3 Unknown, 104 Unchecked, 0.8s Time] [2023-04-01 10:59:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-04-01 10:59:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2023-04-01 10:59:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 49 states have internal predecessors, (60), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (21), 13 states have call predecessors, (21), 12 states have call successors, (21) [2023-04-01 10:59:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2023-04-01 10:59:14,045 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 45 [2023-04-01 10:59:14,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:14,046 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2023-04-01 10:59:14,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 9 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2023-04-01 10:59:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2023-04-01 10:59:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-04-01 10:59:14,047 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:14,048 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:14,057 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 10:59:14,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:14,255 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:14,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1514092454, now seen corresponding path program 1 times [2023-04-01 10:59:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889664041] [2023-04-01 10:59:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:14,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 10:59:14,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:14,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889664041] [2023-04-01 10:59:14,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889664041] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:14,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595505252] [2023-04-01 10:59:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:14,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:14,355 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 10:59:14,357 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 10:59:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:14,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 10:59:14,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 10:59:14,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 10:59:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 10:59:14,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595505252] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:14,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-01 10:59:14,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2023-04-01 10:59:14,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97339510] [2023-04-01 10:59:14,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 10:59:14,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 10:59:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 10:59:14,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-04-01 10:59:14,609 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-01 10:59:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:14,654 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2023-04-01 10:59:14,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 10:59:14,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2023-04-01 10:59:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:14,656 INFO L225 Difference]: With dead ends: 98 [2023-04-01 10:59:14,656 INFO L226 Difference]: Without dead ends: 80 [2023-04-01 10:59:14,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-04-01 10:59:14,657 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:14,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 10:59:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-04-01 10:59:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2023-04-01 10:59:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3125) internal successors, (63), 53 states have internal predecessors, (63), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (22), 13 states have call predecessors, (22), 13 states have call successors, (22) [2023-04-01 10:59:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2023-04-01 10:59:14,674 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 46 [2023-04-01 10:59:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:14,674 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2023-04-01 10:59:14,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-01 10:59:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2023-04-01 10:59:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-04-01 10:59:14,675 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:14,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:14,683 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 10:59:14,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:14,876 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:14,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash 443087121, now seen corresponding path program 2 times [2023-04-01 10:59:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:14,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54491952] [2023-04-01 10:59:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 10:59:14,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54491952] [2023-04-01 10:59:14,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54491952] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975726855] [2023-04-01 10:59:14,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 10:59:14,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:14,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:14,986 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 10:59:15,012 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 10:59:15,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 10:59:15,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 10:59:15,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 10:59:15,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 10:59:15,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 10:59:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 10:59:15,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975726855] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 10:59:15,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [107454865] [2023-04-01 10:59:15,333 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-04-01 10:59:15,334 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 10:59:15,334 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 10:59:15,334 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 10:59:15,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 10:59:15,363 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2023-04-01 10:59:16,085 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_update_at with input of size 58 for LOIs [2023-04-01 10:59:16,115 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 53 for LOIs [2023-04-01 10:59:16,475 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 53 for LOIs [2023-04-01 10:59:16,514 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_get_data_at with input of size 62 for LOIs [2023-04-01 10:59:16,572 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 10:59:16,576 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 10:59:18,435 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2486#(and (not (= main_~len~0 0)) (not (= (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) main_~expected~0)) (= main_~i~0 0) (= main_~len~0 main_~expected~0) (<= 0 (+ (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) 2147483648)) (<= (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) 2147483647))' at error location [2023-04-01 10:59:18,436 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 10:59:18,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 10:59:18,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-04-01 10:59:18,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542264686] [2023-04-01 10:59:18,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 10:59:18,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 10:59:18,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:18,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 10:59:18,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1357, Unknown=4, NotChecked=0, Total=1482 [2023-04-01 10:59:18,438 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2023-04-01 10:59:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:18,574 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2023-04-01 10:59:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 10:59:18,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 46 [2023-04-01 10:59:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:18,576 INFO L225 Difference]: With dead ends: 121 [2023-04-01 10:59:18,576 INFO L226 Difference]: Without dead ends: 94 [2023-04-01 10:59:18,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=135, Invalid=1501, Unknown=4, NotChecked=0, Total=1640 [2023-04-01 10:59:18,577 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:18,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 148 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 10:59:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-04-01 10:59:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2023-04-01 10:59:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.28) internal successors, (64), 55 states have internal predecessors, (64), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (23), 14 states have call predecessors, (23), 14 states have call successors, (23) [2023-04-01 10:59:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2023-04-01 10:59:18,596 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 46 [2023-04-01 10:59:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:18,598 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2023-04-01 10:59:18,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2023-04-01 10:59:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2023-04-01 10:59:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-04-01 10:59:18,599 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:18,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:18,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 10:59:18,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:18,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:18,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash -266798299, now seen corresponding path program 3 times [2023-04-01 10:59:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:18,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639746601] [2023-04-01 10:59:18,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 10:59:18,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:18,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639746601] [2023-04-01 10:59:18,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639746601] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:18,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116043453] [2023-04-01 10:59:18,887 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 10:59:18,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:18,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:18,889 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 10:59:18,912 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 10:59:19,081 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 10:59:19,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 10:59:19,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 10:59:19,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-01 10:59:19,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 10:59:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 10:59:19,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116043453] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 10:59:19,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1384902436] [2023-04-01 10:59:19,158 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-04-01 10:59:19,158 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 10:59:19,159 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 10:59:19,159 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 10:59:19,159 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 10:59:19,178 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2023-04-01 10:59:19,909 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_update_at with input of size 58 for LOIs [2023-04-01 10:59:19,950 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 53 for LOIs [2023-04-01 10:59:20,306 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 53 for LOIs [2023-04-01 10:59:20,350 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_get_data_at with input of size 62 for LOIs [2023-04-01 10:59:20,405 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 10:59:20,407 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 10:59:22,454 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3117#(and (not (= main_~len~0 0)) (not (= (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) main_~expected~0)) (= main_~i~0 0) (= main_~len~0 main_~expected~0) (<= 0 (+ (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) 2147483648)) (<= (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4)) 2147483647))' at error location [2023-04-01 10:59:22,454 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 10:59:22,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 10:59:22,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-04-01 10:59:22,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336067174] [2023-04-01 10:59:22,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 10:59:22,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 10:59:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:22,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 10:59:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1294, Unknown=4, NotChecked=0, Total=1406 [2023-04-01 10:59:22,456 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-01 10:59:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:22,575 INFO L93 Difference]: Finished difference Result 110 states and 143 transitions. [2023-04-01 10:59:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 10:59:22,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 4 states have call successors, (10) Word has length 46 [2023-04-01 10:59:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:22,576 INFO L225 Difference]: With dead ends: 110 [2023-04-01 10:59:22,576 INFO L226 Difference]: Without dead ends: 80 [2023-04-01 10:59:22,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=119, Invalid=1437, Unknown=4, NotChecked=0, Total=1560 [2023-04-01 10:59:22,578 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:22,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 10:59:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-04-01 10:59:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2023-04-01 10:59:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 53 states have internal predecessors, (62), 15 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2023-04-01 10:59:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2023-04-01 10:59:22,588 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 46 [2023-04-01 10:59:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:22,588 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2023-04-01 10:59:22,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-01 10:59:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2023-04-01 10:59:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-04-01 10:59:22,590 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:22,590 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:22,607 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 10:59:22,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:22,805 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:22,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1098235041, now seen corresponding path program 4 times [2023-04-01 10:59:22,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:22,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997978316] [2023-04-01 10:59:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-01 10:59:22,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:22,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997978316] [2023-04-01 10:59:22,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997978316] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:22,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582201504] [2023-04-01 10:59:22,878 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 10:59:22,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:22,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:22,880 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 10:59:22,906 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 10:59:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:23,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 10:59:23,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 10:59:23,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 10:59:23,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582201504] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 10:59:23,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 10:59:23,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2023-04-01 10:59:23,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261814830] [2023-04-01 10:59:23,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 10:59:23,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 10:59:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:23,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 10:59:23,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-01 10:59:23,088 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-01 10:59:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:23,145 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2023-04-01 10:59:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 10:59:23,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 51 [2023-04-01 10:59:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:23,146 INFO L225 Difference]: With dead ends: 103 [2023-04-01 10:59:23,146 INFO L226 Difference]: Without dead ends: 78 [2023-04-01 10:59:23,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 10:59:23,147 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:23,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 10:59:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-04-01 10:59:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2023-04-01 10:59:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 52 states have internal predecessors, (60), 15 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2023-04-01 10:59:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2023-04-01 10:59:23,156 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 51 [2023-04-01 10:59:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:23,157 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2023-04-01 10:59:23,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-01 10:59:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2023-04-01 10:59:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-04-01 10:59:23,158 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:23,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:23,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 10:59:23,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:23,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:23,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:23,364 INFO L85 PathProgramCache]: Analyzing trace with hash 330838587, now seen corresponding path program 5 times [2023-04-01 10:59:23,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:23,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752924013] [2023-04-01 10:59:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 10:59:23,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:23,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752924013] [2023-04-01 10:59:23,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752924013] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:23,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387409728] [2023-04-01 10:59:23,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 10:59:23,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:23,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:23,469 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 10:59:23,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 10:59:23,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-04-01 10:59:23,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 10:59:23,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 10:59:23,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-01 10:59:23,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 10:59:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387409728] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 10:59:23,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 10:59:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-04-01 10:59:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134979236] [2023-04-01 10:59:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 10:59:23,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 10:59:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:23,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 10:59:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-04-01 10:59:23,821 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 10:59:23,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:23,877 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2023-04-01 10:59:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 10:59:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2023-04-01 10:59:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:23,878 INFO L225 Difference]: With dead ends: 111 [2023-04-01 10:59:23,878 INFO L226 Difference]: Without dead ends: 75 [2023-04-01 10:59:23,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-04-01 10:59:23,883 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:23,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 10:59:23,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-04-01 10:59:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2023-04-01 10:59:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (16), 13 states have call predecessors, (16), 13 states have call successors, (16) [2023-04-01 10:59:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2023-04-01 10:59:23,895 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 52 [2023-04-01 10:59:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:23,895 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2023-04-01 10:59:23,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 10:59:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2023-04-01 10:59:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-04-01 10:59:23,896 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:23,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:23,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 10:59:24,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 10:59:24,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:24,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1910199012, now seen corresponding path program 1 times [2023-04-01 10:59:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688450954] [2023-04-01 10:59:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 10:59:24,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:24,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688450954] [2023-04-01 10:59:24,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688450954] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:24,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603700412] [2023-04-01 10:59:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:24,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:24,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:24,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 10:59:24,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 10:59:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:24,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 10:59:24,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 10:59:24,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 10:59:24,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603700412] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 10:59:24,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 10:59:24,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2023-04-01 10:59:24,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936915360] [2023-04-01 10:59:24,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 10:59:24,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 10:59:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:24,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 10:59:24,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-01 10:59:24,391 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 10:59:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:24,455 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2023-04-01 10:59:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 10:59:24,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2023-04-01 10:59:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:24,457 INFO L225 Difference]: With dead ends: 77 [2023-04-01 10:59:24,457 INFO L226 Difference]: Without dead ends: 73 [2023-04-01 10:59:24,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 10:59:24,458 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:24,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 10:59:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-04-01 10:59:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2023-04-01 10:59:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-04-01 10:59:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2023-04-01 10:59:24,470 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 52 [2023-04-01 10:59:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:24,470 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2023-04-01 10:59:24,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 10:59:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2023-04-01 10:59:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-04-01 10:59:24,472 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:24,472 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:24,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 10:59:24,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:24,679 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:24,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:24,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1542698612, now seen corresponding path program 6 times [2023-04-01 10:59:24,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:24,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249947754] [2023-04-01 10:59:24,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:24,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 10:59:24,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249947754] [2023-04-01 10:59:24,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249947754] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814039346] [2023-04-01 10:59:24,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 10:59:24,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:24,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:24,805 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 10:59:24,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 10:59:24,987 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 10:59:24,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 10:59:24,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 10:59:24,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 10:59:25,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 10:59:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 10:59:25,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814039346] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:25,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-01 10:59:25,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2023-04-01 10:59:25,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91293854] [2023-04-01 10:59:25,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 10:59:25,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 10:59:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:25,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 10:59:25,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-04-01 10:59:25,123 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-04-01 10:59:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:25,162 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2023-04-01 10:59:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 10:59:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 52 [2023-04-01 10:59:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:25,163 INFO L225 Difference]: With dead ends: 82 [2023-04-01 10:59:25,163 INFO L226 Difference]: Without dead ends: 48 [2023-04-01 10:59:25,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-04-01 10:59:25,164 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:25,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 74 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 10:59:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-01 10:59:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-04-01 10:59:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 10:59:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2023-04-01 10:59:25,170 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 52 [2023-04-01 10:59:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:25,170 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2023-04-01 10:59:25,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-04-01 10:59:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2023-04-01 10:59:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-04-01 10:59:25,171 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:25,171 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:25,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 10:59:25,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 10:59:25,377 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:25,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:25,377 INFO L85 PathProgramCache]: Analyzing trace with hash -317534893, now seen corresponding path program 1 times [2023-04-01 10:59:25,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:25,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320707110] [2023-04-01 10:59:25,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:25,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 10:59:26,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:26,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320707110] [2023-04-01 10:59:26,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320707110] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:26,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364147796] [2023-04-01 10:59:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:26,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:26,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:26,917 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 10:59:26,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 10:59:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:27,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 117 conjunts are in the unsatisfiable core [2023-04-01 10:59:27,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:27,128 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 10:59:27,282 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-01 10:59:27,282 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 11 treesize of output 11 [2023-04-01 10:59:27,324 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 10:59:27,373 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-01 10:59:27,374 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-04-01 10:59:27,584 WARN L861 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int) (v_ArrVal_1175 Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) (+ sll_circular_update_at_~head.offset 4) v_ArrVal_1175))) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset))) is different from true [2023-04-01 10:59:27,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 10:59:27,597 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 22 treesize of output 21 [2023-04-01 10:59:27,769 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 25 treesize of output 17 [2023-04-01 10:59:27,858 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-01 10:59:27,859 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 60 [2023-04-01 10:59:27,874 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 45 treesize of output 45 [2023-04-01 10:59:28,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 10:59:28,558 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 102 treesize of output 82 [2023-04-01 10:59:28,573 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-04-01 10:59:28,573 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 66 treesize of output 16 [2023-04-01 10:59:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-04-01 10:59:28,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 10:59:29,148 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 116 treesize of output 88 [2023-04-01 10:59:29,153 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 104 treesize of output 96 [2023-04-01 10:59:29,156 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 79 treesize of output 75 [2023-04-01 10:59:29,167 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 116 treesize of output 88 [2023-04-01 10:59:29,169 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 10:59:29,313 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 76 treesize of output 56 [2023-04-01 10:59:29,322 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 76 treesize of output 56 [2023-04-01 10:59:32,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 10:59:32,546 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 19 treesize of output 20 [2023-04-01 10:59:32,548 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 10:59:32,551 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 10:59:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 10:59:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364147796] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 10:59:33,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [80671055] [2023-04-01 10:59:33,046 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-04-01 10:59:33,046 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 10:59:33,047 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 10:59:33,047 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 10:59:33,047 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 10:59:33,072 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2023-04-01 10:59:33,811 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_update_at with input of size 58 for LOIs [2023-04-01 10:59:33,844 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 53 for LOIs [2023-04-01 10:59:34,153 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 53 for LOIs [2023-04-01 10:59:34,184 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_get_data_at with input of size 1 for LOIs [2023-04-01 10:59:34,190 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 10:59:34,192 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 10:59:37,469 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5669#(not (= main_~len~0 main_~i~0))' at error location [2023-04-01 10:59:37,470 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 10:59:37,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 10:59:37,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33, 30] total 84 [2023-04-01 10:59:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534417560] [2023-04-01 10:59:37,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 10:59:37,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-04-01 10:59:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-04-01 10:59:37,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=11078, Unknown=57, NotChecked=212, Total=11772 [2023-04-01 10:59:37,474 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 84 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 69 states have internal predecessors, (93), 17 states have call successors, (20), 8 states have call predecessors, (20), 19 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) [2023-04-01 10:59:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:41,676 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2023-04-01 10:59:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-01 10:59:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 69 states have internal predecessors, (93), 17 states have call successors, (20), 8 states have call predecessors, (20), 19 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) Word has length 53 [2023-04-01 10:59:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:41,677 INFO L225 Difference]: With dead ends: 54 [2023-04-01 10:59:41,677 INFO L226 Difference]: Without dead ends: 49 [2023-04-01 10:59:41,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 133 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4449 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=771, Invalid=16995, Unknown=60, NotChecked=264, Total=18090 [2023-04-01 10:59:41,680 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 173 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 94 mSolverCounterUnsat, 71 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 71 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:41,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 298 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1686 Invalid, 71 Unknown, 52 Unchecked, 1.7s Time] [2023-04-01 10:59:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-04-01 10:59:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-04-01 10:59:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 10:59:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-04-01 10:59:41,688 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 53 [2023-04-01 10:59:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:41,688 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-04-01 10:59:41,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 69 states have internal predecessors, (93), 17 states have call successors, (20), 8 states have call predecessors, (20), 19 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) [2023-04-01 10:59:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-04-01 10:59:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-01 10:59:41,689 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 10:59:41,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 10:59:41,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 10:59:41,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 10:59:41,895 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 10:59:41,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 10:59:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1810412540, now seen corresponding path program 2 times [2023-04-01 10:59:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 10:59:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834286999] [2023-04-01 10:59:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 10:59:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 10:59:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 10:59:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 10:59:41,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 10:59:41,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834286999] [2023-04-01 10:59:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834286999] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 10:59:41,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078814614] [2023-04-01 10:59:41,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 10:59:41,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 10:59:41,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 10:59:41,998 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 10:59:42,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 10:59:42,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 10:59:42,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 10:59:42,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 10:59:42,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 10:59:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-01 10:59:42,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 10:59:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-01 10:59:42,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078814614] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 10:59:42,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1672263301] [2023-04-01 10:59:42,356 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-04-01 10:59:42,356 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 10:59:42,356 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 10:59:42,356 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 10:59:42,356 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 10:59:42,377 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2023-04-01 10:59:43,036 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_update_at with input of size 58 for LOIs [2023-04-01 10:59:43,065 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_create with input of size 53 for LOIs [2023-04-01 10:59:43,389 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 53 for LOIs [2023-04-01 10:59:43,431 INFO L197 IcfgInterpreter]: Interpreting procedure sll_circular_get_data_at with input of size 1 for LOIs [2023-04-01 10:59:43,439 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 10:59:43,456 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 10:59:45,118 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6243#(not (= main_~len~0 main_~i~0))' at error location [2023-04-01 10:59:45,118 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 10:59:45,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 10:59:45,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-04-01 10:59:45,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349797616] [2023-04-01 10:59:45,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 10:59:45,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 10:59:45,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 10:59:45,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 10:59:45,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1091, Unknown=1, NotChecked=0, Total=1190 [2023-04-01 10:59:45,120 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-01 10:59:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 10:59:45,239 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2023-04-01 10:59:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 10:59:45,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 54 [2023-04-01 10:59:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 10:59:45,240 INFO L225 Difference]: With dead ends: 49 [2023-04-01 10:59:45,240 INFO L226 Difference]: Without dead ends: 0 [2023-04-01 10:59:45,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=123, Invalid=1358, Unknown=1, NotChecked=0, Total=1482 [2023-04-01 10:59:45,241 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 10:59:45,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 96 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 10:59:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-01 10:59:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-01 10:59:45,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-01 10:59:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-01 10:59:45,242 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2023-04-01 10:59:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 10:59:45,242 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-01 10:59:45,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-01 10:59:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-01 10:59:45,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-01 10:59:45,245 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 10:59:45,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-01 10:59:45,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 10:59:45,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-01 10:59:46,244 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2023-04-01 10:59:46,244 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 12) no Hoare annotation was computed. [2023-04-01 10:59:46,244 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-04-01 10:59:46,244 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 571 573) the Hoare annotation is: true [2023-04-01 10:59:46,244 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 571 573) no Hoare annotation was computed. [2023-04-01 10:59:46,244 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 74 78) no Hoare annotation was computed. [2023-04-01 10:59:46,244 INFO L899 garLoopResultBuilder]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2023-04-01 10:59:46,244 INFO L902 garLoopResultBuilder]: At program point L577(line 577) the Hoare annotation is: true [2023-04-01 10:59:46,244 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-04-01 10:59:46,244 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2023-04-01 10:59:46,245 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-04-01 10:59:46,245 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-04-01 10:59:46,245 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 10:59:46,245 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-01 10:59:46,245 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 620 639) no Hoare annotation was computed. [2023-04-01 10:59:46,245 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 620 639) no Hoare annotation was computed. [2023-04-01 10:59:46,245 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 620 639) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-04-01 10:59:46,245 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2023-04-01 10:59:46,245 INFO L899 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2023-04-01 10:59:46,245 INFO L895 garLoopResultBuilder]: At program point L631(line 631) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) 0)) 4))) (let ((.cse0 (<= .cse1 3)) (.cse2 (<= 3 .cse1)) (.cse3 (forall ((v_node_create_~temp~0.base_84 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_84) 0)) (= 0 (select |old(#valid)| v_node_create_~temp~0.base_84))))) (.cse4 (= main_~len~0 2)) (.cse5 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse6 (= 2 (select (select |#memory_int| main_~s~0.base) 4))) (.cse7 (= 3 main_~new_data~0)) (.cse8 (= main_~s~0.offset 0))) (or (and .cse0 (<= .cse1 main_~expected~0) .cse2 .cse3 (= main_~i~0 1) .cse4 (<= main_~expected~0 .cse1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 (= main_~i~0 0) .cse5 (= 2 main_~expected~0) .cse6 .cse7 .cse8)))) [2023-04-01 10:59:46,245 INFO L899 garLoopResultBuilder]: For program point L631-1(line 631) no Hoare annotation was computed. [2023-04-01 10:59:46,246 INFO L899 garLoopResultBuilder]: For program point L631-2(lines 631 633) no Hoare annotation was computed. [2023-04-01 10:59:46,246 INFO L895 garLoopResultBuilder]: At program point L627(line 627) the Hoare annotation is: (let ((.cse0 (forall ((v_node_create_~temp~0.base_84 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_84) 0)) (= 0 (select |old(#valid)| v_node_create_~temp~0.base_84))))) (.cse1 (= main_~len~0 2)) (.cse2 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse3 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 0) main_~s~0.base))) (.cse4 (= main_~s~0.offset 0))) (or (and .cse0 .cse1 (= main_~i~0 0) .cse2 (= 2 main_~new_data~0) .cse3 .cse4) (and .cse0 (= main_~i~0 1) .cse1 .cse2 (= 2 (select (select |#memory_int| main_~s~0.base) 4)) (= 3 main_~new_data~0) .cse3 .cse4))) [2023-04-01 10:59:46,246 INFO L899 garLoopResultBuilder]: For program point L627-1(lines 625 628) no Hoare annotation was computed. [2023-04-01 10:59:46,246 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) 0)) 4))) (let ((.cse1 (<= .cse8 3)) (.cse2 (<= 3 .cse8)) (.cse3 (forall ((v_node_create_~temp~0.base_84 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_84) 0)) (= 0 (select |old(#valid)| v_node_create_~temp~0.base_84))))) (.cse0 (= main_~len~0 2)) (.cse4 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse5 (= 2 (select (select |#memory_int| main_~s~0.base) 4))) (.cse6 (= 3 main_~new_data~0)) (.cse7 (= main_~s~0.offset 0))) (or (and (<= 2 main_~i~0) .cse0) (and .cse1 .cse2 .cse3 (= main_~i~0 1) .cse0 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse0 (= main_~i~0 0) .cse4 .cse5 .cse6 .cse7)))) [2023-04-01 10:59:46,246 INFO L895 garLoopResultBuilder]: At program point L629-4(lines 629 634) the Hoare annotation is: (= main_~len~0 2) [2023-04-01 10:59:46,246 INFO L895 garLoopResultBuilder]: At program point L623(line 623) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= main_~len~0 2) (= |old(#valid)| |#valid|)) [2023-04-01 10:59:46,246 INFO L895 garLoopResultBuilder]: At program point L625-2(lines 625 628) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$.base| main_~s~0.base) 0))) (let ((.cse3 (= 2 (select (select |#memory_int| main_~s~0.base) 4))) (.cse0 (forall ((v_node_create_~temp~0.base_84 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_84) 0)) (= 0 (select |old(#valid)| v_node_create_~temp~0.base_84))))) (.cse1 (= main_~len~0 2)) (.cse2 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse4 (not (= .cse7 main_~s~0.base))) (.cse5 (= main_~s~0.offset 0))) (or (and .cse0 (= main_~i~0 1) .cse1 .cse2 .cse3 (= 2 main_~new_data~0) .cse4 .cse5) (let ((.cse6 (select (select |#memory_int| .cse7) 4))) (and (<= .cse6 3) (<= 3 .cse6) (<= 2 main_~i~0) .cse0 .cse1 .cse2 .cse3 (= 3 main_~new_data~0) .cse5)) (and .cse0 .cse1 (= main_~i~0 0) .cse2 .cse4 .cse5)))) [2023-04-01 10:59:46,246 INFO L899 garLoopResultBuilder]: For program point L623-1(line 623) no Hoare annotation was computed. [2023-04-01 10:59:46,246 INFO L895 garLoopResultBuilder]: At program point ERROR(lines 620 639) the Hoare annotation is: false [2023-04-01 10:59:46,246 INFO L899 garLoopResultBuilder]: For program point sll_circular_update_atEXIT(lines 613 619) no Hoare annotation was computed. [2023-04-01 10:59:46,247 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 613 619) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2023-04-01 10:59:46,247 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (and (let ((.cse0 (<= |sll_circular_update_at_#in~data| sll_circular_update_at_~data)) (.cse1 (<= sll_circular_update_at_~data |sll_circular_update_at_#in~data|)) (.cse4 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse5 (<= (+ sll_circular_update_at_~index 1) |sll_circular_update_at_#in~index|))) (or (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) .cse3 .cse4 .cse5) (and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) .cse0 .cse1 .cse2 .cse3 .cse4 (= |sll_circular_update_at_#in~index| sll_circular_update_at_~index) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|)) (and (<= 2 |sll_circular_update_at_#in~index|) .cse2 .cse3 .cse5))) (or (< 0 |sll_circular_update_at_#in~index|) (<= |sll_circular_update_at_#in~index| sll_circular_update_at_~index))) [2023-04-01 10:59:46,247 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2023-04-01 10:59:46,247 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2023-04-01 10:59:46,247 INFO L899 garLoopResultBuilder]: For program point L596-2(lines 595 605) no Hoare annotation was computed. [2023-04-01 10:59:46,247 INFO L899 garLoopResultBuilder]: For program point sll_circular_destroyEXIT(lines 595 605) no Hoare annotation was computed. [2023-04-01 10:59:46,247 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 595 605) the Hoare annotation is: true [2023-04-01 10:59:46,247 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 79 83) no Hoare annotation was computed. [2023-04-01 10:59:46,247 INFO L899 garLoopResultBuilder]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2023-04-01 10:59:46,247 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (or (<= 3 |sll_circular_create_#in~len|) (and (= sll_circular_create_~head~0.offset 0) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (forall ((v_node_create_~temp~0.base_84 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_84) 0)) (= 0 (select |old(#valid)| v_node_create_~temp~0.base_84)))) (= (select |#valid| sll_circular_create_~last~0.base) 1) (< sll_circular_create_~len 3))) [2023-04-01 10:59:46,247 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-04-01 10:59:46,248 INFO L899 garLoopResultBuilder]: For program point sll_circular_createEXIT(lines 583 594) no Hoare annotation was computed. [2023-04-01 10:59:46,248 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 583 594) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-04-01 10:59:46,248 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (= 2 sll_circular_create_~len) (= |sll_circular_create_#in~len| sll_circular_create_~len)) (= |old(#valid)| |#valid|)) [2023-04-01 10:59:46,248 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= sll_circular_create_~head~0.offset 0)) (.cse2 (forall ((v_node_create_~temp~0.base_84 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_84) 0)) (= 0 (select |old(#valid)| v_node_create_~temp~0.base_84))))) (.cse1 (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base))) (or (<= 3 |sll_circular_create_#in~len|) (and .cse0 .cse1 .cse2 (= (select |#valid| sll_circular_create_~last~0.base) 1) (or (= 2 sll_circular_create_~len) (= |sll_circular_create_#in~len| sll_circular_create_~len))) (and (= sll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) 0)) .cse0 (= (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) 0) 0) (<= sll_circular_create_~len 1) .cse2 (not .cse1)))) [2023-04-01 10:59:46,248 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-04-01 10:59:46,248 INFO L899 garLoopResultBuilder]: For program point sll_circular_get_data_atEXIT(lines 606 612) no Hoare annotation was computed. [2023-04-01 10:59:46,248 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse0 (<= (+ sll_circular_get_data_at_~index 1) |sll_circular_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_circular_get_data_at_#in~index|)) (forall ((v_main_~s~0.base_BEFORE_CALL_15 Int)) (not (= (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_15) 4) 2))) (and (<= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|) (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (<= |sll_circular_get_data_at_#in~index| sll_circular_get_data_at_~index)) (and .cse0 (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (<= 1 |sll_circular_get_data_at_#in~index|) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base)) (forall ((v_main_~s~0.base_BEFORE_CALL_55 Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_55) 0))) (let ((.cse2 (select (select |#memory_int| .cse1) (+ (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_55) 0) 4)))) (or (= v_main_~s~0.base_BEFORE_CALL_55 .cse1) (< .cse2 3) (< 3 .cse2))))))) [2023-04-01 10:59:46,248 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 606 612) the Hoare annotation is: true [2023-04-01 10:59:46,248 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-01 10:59:46,248 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-04-01 10:59:46,248 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-01 10:59:46,249 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 10:59:46,251 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1] [2023-04-01 10:59:46,252 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 10:59:46,258 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,258 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,259 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,260 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,260 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,260 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,264 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,264 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,265 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,265 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,266 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,266 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,275 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,275 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,277 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,277 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,289 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,289 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,289 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,290 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,290 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_15,QUANTIFIED] [2023-04-01 10:59:46,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,291 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,291 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,291 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,291 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,292 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,292 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,292 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_15,QUANTIFIED] [2023-04-01 10:59:46,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,294 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,295 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,295 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,295 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,295 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,296 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,296 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,297 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,297 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 10:59:46 BoogieIcfgContainer [2023-04-01 10:59:46,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 10:59:46,299 INFO L158 Benchmark]: Toolchain (without parser) took 50243.40ms. Allocated memory was 278.9MB in the beginning and 738.2MB in the end (delta: 459.3MB). Free memory was 239.8MB in the beginning and 342.8MB in the end (delta: -103.1MB). Peak memory consumption was 357.3MB. Max. memory is 8.0GB. [2023-04-01 10:59:46,299 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 10:59:46,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.65ms. Allocated memory is still 278.9MB. Free memory was 239.8MB in the beginning and 222.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-04-01 10:59:46,299 INFO L158 Benchmark]: Boogie Preprocessor took 64.26ms. Allocated memory is still 278.9MB. Free memory was 222.5MB in the beginning and 219.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-04-01 10:59:46,299 INFO L158 Benchmark]: RCFGBuilder took 540.15ms. Allocated memory is still 278.9MB. Free memory was 219.3MB in the beginning and 193.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-04-01 10:59:46,300 INFO L158 Benchmark]: TraceAbstraction took 49246.78ms. Allocated memory was 278.9MB in the beginning and 738.2MB in the end (delta: 459.3MB). Free memory was 192.1MB in the beginning and 342.8MB in the end (delta: -150.8MB). Peak memory consumption was 310.1MB. Max. memory is 8.0GB. [2023-04-01 10:59:46,300 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 385.65ms. Allocated memory is still 278.9MB. Free memory was 239.8MB in the beginning and 222.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.26ms. Allocated memory is still 278.9MB. Free memory was 222.5MB in the beginning and 219.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 540.15ms. Allocated memory is still 278.9MB. Free memory was 219.3MB in the beginning and 193.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 49246.78ms. Allocated memory was 278.9MB in the beginning and 738.2MB in the end (delta: 459.3MB). Free memory was 192.1MB in the beginning and 342.8MB in the end (delta: -150.8MB). Peak memory consumption was 310.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 637]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.2s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 74 mSolverCounterUnknown, 527 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 485 mSDsluCounter, 1936 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 156 IncrementalHoareTripleChecker+Unchecked, 1549 mSDsCounter, 211 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3932 IncrementalHoareTripleChecker+Invalid, 4373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 211 mSolverCounterUnsat, 387 mSDtfsCounter, 3932 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1397 GetRequests, 937 SyntacticMatches, 22 SemanticMatches, 438 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8751 ImplicationChecksByTransitivity, 25.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=7, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 85 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 85 PreInvPairs, 122 NumberOfFragments, 907 HoareAnnotationTreeSize, 85 FomulaSimplifications, 3029 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 856 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 1215 NumberOfCodeBlocks, 1198 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1517 ConstructedInterpolants, 22 QuantifiedInterpolants, 5911 SizeOfPredicates, 58 NumberOfNonLiveVariables, 4307 ConjunctsInSsa, 275 ConjunctsInUnsatCore, 33 InterpolantComputations, 8 PerfectInterpolantSequences, 502/637 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 625]: Loop Invariant [2023-04-01 10:59:46,307 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,307 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,308 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,308 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,310 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,310 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,310 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,310 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((forall v_node_create_~temp~0.base_84 : int :: !(\valid[v_node_create_~temp~0.base_84] == 0) || 0 == \old(\valid)[v_node_create_~temp~0.base_84]) && i == 1) && len == 2) && #memory_$Pointer$[s][0] == 0) && 2 == unknown-#memory_int-unknown[s][4]) && 2 == new_data) && !(#memory_$Pointer$[s][0] == s)) && s == 0) || ((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3 && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && 2 <= i) && (forall v_node_create_~temp~0.base_84 : int :: !(\valid[v_node_create_~temp~0.base_84] == 0) || 0 == \old(\valid)[v_node_create_~temp~0.base_84])) && len == 2) && #memory_$Pointer$[s][0] == 0) && 2 == unknown-#memory_int-unknown[s][4]) && 3 == new_data) && s == 0)) || ((((((forall v_node_create_~temp~0.base_84 : int :: !(\valid[v_node_create_~temp~0.base_84] == 0) || 0 == \old(\valid)[v_node_create_~temp~0.base_84]) && len == 2) && i == 0) && #memory_$Pointer$[s][0] == 0) && !(#memory_$Pointer$[s][0] == s)) && s == 0) - InvariantResult [Line: 614]: Loop Invariant [2023-04-01 10:59:46,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((\old(data) <= data && data <= \old(data)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$[head][head] == head) && head == #memory_$Pointer$[head][head]) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && index + 1 <= \old(index)) || (((((((head == head && \old(data) <= data) && data <= \old(data)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(index) == index) && head == head)) || (((2 <= \old(index) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && index + 1 <= \old(index))) && (0 < \old(index) || \old(index) <= index) - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2023-04-01 10:59:46,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] Derived loop invariant: (3 <= \old(len) || ((((head == 0 && head == last) && (forall v_node_create_~temp~0.base_84 : int :: !(\valid[v_node_create_~temp~0.base_84] == 0) || 0 == \old(\valid)[v_node_create_~temp~0.base_84])) && \valid[last] == 1) && (2 == len || \old(len) == len))) || (((((last == #memory_$Pointer$[head][0] && head == 0) && #memory_$Pointer$[head][0] == 0) && len <= 1) && (forall v_node_create_~temp~0.base_84 : int :: !(\valid[v_node_create_~temp~0.base_84] == 0) || 0 == \old(\valid)[v_node_create_~temp~0.base_84])) && !(head == last)) - InvariantResult [Line: 607]: Loop Invariant [2023-04-01 10:59:46,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_15,QUANTIFIED] [2023-04-01 10:59:46,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_15,QUANTIFIED] [2023-04-01 10:59:46,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] [2023-04-01 10:59:46,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_55,QUANTIFIED] Derived loop invariant: ((((index + 1 <= \old(index) && 2 <= \old(index)) || (forall v_main_~s~0.base_BEFORE_CALL_15 : int :: !(unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_15][4] == 2))) || (((index <= \old(index) && head == head) && head == head) && \old(index) <= index)) || (((index + 1 <= \old(index) && head == #memory_$Pointer$[head][head]) && 1 <= \old(index)) && #memory_$Pointer$[head][head] == head)) || (forall v_main_~s~0.base_BEFORE_CALL_55 : int :: (v_main_~s~0.base_BEFORE_CALL_55 == #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_55][0] || unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_55][0]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_55][0] + 4] < 3) || 3 < unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_55][0]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_55][0] + 4]) - InvariantResult [Line: 629]: Loop Invariant [2023-04-01 10:59:46,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,320 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,320 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,320 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 10:59:46,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 10:59:46,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_84,QUANTIFIED] [2023-04-01 10:59:46,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((2 <= i && len == 2) || ((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3 && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && (forall v_node_create_~temp~0.base_84 : int :: !(\valid[v_node_create_~temp~0.base_84] == 0) || 0 == \old(\valid)[v_node_create_~temp~0.base_84])) && i == 1) && len == 2) && #memory_$Pointer$[s][0] == 0) && 2 == unknown-#memory_int-unknown[s][4]) && 3 == new_data) && s == 0)) || ((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3 && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && (forall v_node_create_~temp~0.base_84 : int :: !(\valid[v_node_create_~temp~0.base_84] == 0) || 0 == \old(\valid)[v_node_create_~temp~0.base_84])) && len == 2) && i == 0) && #memory_$Pointer$[s][0] == 0) && 2 == unknown-#memory_int-unknown[s][4]) && 3 == new_data) && s == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2023-04-01 10:59:46,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...