/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 00:13:37,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 00:13:37,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 00:13:37,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 00:13:37,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 00:13:37,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 00:13:37,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 00:13:37,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 00:13:37,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 00:13:37,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 00:13:37,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 00:13:37,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 00:13:37,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 00:13:37,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 00:13:37,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 00:13:37,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 00:13:37,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 00:13:37,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 00:13:37,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 00:13:37,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 00:13:37,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 00:13:37,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 00:13:37,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 00:13:37,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 00:13:37,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 00:13:37,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 00:13:37,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 00:13:37,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 00:13:37,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 00:13:37,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 00:13:37,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 00:13:37,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 00:13:37,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 00:13:37,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 00:13:37,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 00:13:37,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 00:13:37,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 00:13:37,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 00:13:37,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 00:13:37,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 00:13:37,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 00:13:37,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-03-31 00:13:37,111 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 00:13:37,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 00:13:37,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 00:13:37,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 00:13:37,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 00:13:37,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 00:13:37,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-31 00:13:37,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-31 00:13:37,113 INFO L138 SettingsManager]: * Use SBE=true [2023-03-31 00:13:37,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 00:13:37,113 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 00:13:37,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 00:13:37,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 00:13:37,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 00:13:37,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 00:13:37,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 00:13:37,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 00:13:37,114 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 00:13:37,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 00:13:37,114 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 00:13:37,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 00:13:37,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 00:13:37,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-31 00:13:37,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 00:13:37,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 00:13:37,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 00:13:37,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 00:13:37,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 00:13:37,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-31 00:13:37,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 00:13:37,115 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-31 00:13:37,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 00:13:37,116 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-31 00:13:37,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-31 00:13:37,116 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-31 00:13:37,116 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-03-31 00:13:37,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 00:13:37,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 00:13:37,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 00:13:37,369 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 00:13:37,369 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 00:13:37,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2023-03-31 00:13:38,656 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 00:13:38,842 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 00:13:38,843 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2023-03-31 00:13:38,856 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cda85db0/9db401b9b3784529a598a37a1a04cd34/FLAG32e3e55d3 [2023-03-31 00:13:38,870 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cda85db0/9db401b9b3784529a598a37a1a04cd34 [2023-03-31 00:13:38,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 00:13:38,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 00:13:38,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 00:13:38,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 00:13:38,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 00:13:38,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 12:13:38" (1/1) ... [2023-03-31 00:13:38,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c599a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:38, skipping insertion in model container [2023-03-31 00:13:38,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 12:13:38" (1/1) ... [2023-03-31 00:13:38,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 00:13:38,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 00:13:39,141 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_reverse.i[24436,24449] [2023-03-31 00:13:39,149 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 00:13:39,158 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 00:13:39,187 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_reverse.i[24436,24449] [2023-03-31 00:13:39,187 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 00:13:39,208 INFO L208 MainTranslator]: Completed translation [2023-03-31 00:13:39,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39 WrapperNode [2023-03-31 00:13:39,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 00:13:39,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 00:13:39,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 00:13:39,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 00:13:39,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39" (1/1) ... [2023-03-31 00:13:39,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39" (1/1) ... [2023-03-31 00:13:39,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39" (1/1) ... [2023-03-31 00:13:39,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39" (1/1) ... [2023-03-31 00:13:39,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39" (1/1) ... [2023-03-31 00:13:39,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39" (1/1) ... [2023-03-31 00:13:39,240 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39" (1/1) ... [2023-03-31 00:13:39,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39" (1/1) ... [2023-03-31 00:13:39,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 00:13:39,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 00:13:39,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 00:13:39,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 00:13:39,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39" (1/1) ... [2023-03-31 00:13:39,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 00:13:39,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:39,285 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-03-31 00:13:39,289 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-03-31 00:13:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 00:13:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 00:13:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 00:13:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-03-31 00:13:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-03-31 00:13:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-03-31 00:13:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-03-31 00:13:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2023-03-31 00:13:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2023-03-31 00:13:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2023-03-31 00:13:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2023-03-31 00:13:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 00:13:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 00:13:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 00:13:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-03-31 00:13:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-03-31 00:13:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 00:13:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 00:13:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-03-31 00:13:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-03-31 00:13:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-03-31 00:13:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-03-31 00:13:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-03-31 00:13:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-03-31 00:13:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-03-31 00:13:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-03-31 00:13:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-03-31 00:13:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2023-03-31 00:13:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-03-31 00:13:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 00:13:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2023-03-31 00:13:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 00:13:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2023-03-31 00:13:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 00:13:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 00:13:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 00:13:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 00:13:39,491 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 00:13:39,493 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 00:13:39,531 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-03-31 00:13:39,687 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 00:13:39,692 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 00:13:39,692 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-03-31 00:13:39,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 12:13:39 BoogieIcfgContainer [2023-03-31 00:13:39,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 00:13:39,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 00:13:39,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 00:13:39,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 00:13:39,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 12:13:38" (1/3) ... [2023-03-31 00:13:39,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674321eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 12:13:39, skipping insertion in model container [2023-03-31 00:13:39,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:13:39" (2/3) ... [2023-03-31 00:13:39,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674321eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 12:13:39, skipping insertion in model container [2023-03-31 00:13:39,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 12:13:39" (3/3) ... [2023-03-31 00:13:39,700 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2023-03-31 00:13:39,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 00:13:39,713 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 00:13:39,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 00:13:39,772 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=PETRI_NET, 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;@662d4674, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-31 00:13:39,772 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 00:13:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 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-03-31 00:13:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-03-31 00:13:39,785 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:39,786 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, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:13:39,786 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:39,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:39,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1043724773, now seen corresponding path program 1 times [2023-03-31 00:13:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:39,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912336425] [2023-03-31 00:13:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-03-31 00:13:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:13:40,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:40,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912336425] [2023-03-31 00:13:40,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912336425] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:13:40,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:13:40,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-03-31 00:13:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581105616] [2023-03-31 00:13:40,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:13:40,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-03-31 00:13:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-03-31 00:13:40,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-03-31 00:13:40,305 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 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 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-03-31 00:13:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:40,685 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2023-03-31 00:13:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-03-31 00:13:40,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (5), 3 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 32 [2023-03-31 00:13:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:40,693 INFO L225 Difference]: With dead ends: 105 [2023-03-31 00:13:40,693 INFO L226 Difference]: Without dead ends: 46 [2023-03-31 00:13:40,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-03-31 00:13:40,702 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 94 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:40,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 16 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 00:13:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-03-31 00:13:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2023-03-31 00:13:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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-03-31 00:13:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-03-31 00:13:40,735 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 32 [2023-03-31 00:13:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:40,736 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-03-31 00:13:40,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-03-31 00:13:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-03-31 00:13:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-03-31 00:13:40,737 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:40,737 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-03-31 00:13:40,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 00:13:40,738 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:40,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 311166707, now seen corresponding path program 1 times [2023-03-31 00:13:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:40,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123425801] [2023-03-31 00:13:40,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:40,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-03-31 00:13:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-03-31 00:13:40,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:40,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123425801] [2023-03-31 00:13:40,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123425801] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:13:40,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:13:40,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-03-31 00:13:40,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079082784] [2023-03-31 00:13:40,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:13:40,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 00:13:40,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:40,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 00:13:40,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-03-31 00:13:40,925 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-03-31 00:13:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:41,079 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2023-03-31 00:13:41,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-03-31 00:13:41,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (6), 3 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 40 [2023-03-31 00:13:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:41,083 INFO L225 Difference]: With dead ends: 67 [2023-03-31 00:13:41,083 INFO L226 Difference]: Without dead ends: 54 [2023-03-31 00:13:41,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-03-31 00:13:41,090 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 79 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:41,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 7 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:13:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-03-31 00:13:41,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2023-03-31 00:13:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-03-31 00:13:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-03-31 00:13:41,100 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 40 [2023-03-31 00:13:41,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:41,100 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-03-31 00:13:41,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-03-31 00:13:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-03-31 00:13:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-03-31 00:13:41,101 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:41,101 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:13:41,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 00:13:41,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:41,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1308016445, now seen corresponding path program 1 times [2023-03-31 00:13:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748962397] [2023-03-31 00:13:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:41,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:41,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:41,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 00:13:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:41,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-03-31 00:13:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-03-31 00:13:41,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:41,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748962397] [2023-03-31 00:13:41,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748962397] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289606929] [2023-03-31 00:13:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:41,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:41,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:41,355 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-03-31 00:13:41,423 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-03-31 00:13:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:41,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-31 00:13:41,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:13:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-03-31 00:13:41,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 00:13:41,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289606929] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:13:41,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-31 00:13:41,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-03-31 00:13:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246178526] [2023-03-31 00:13:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:13:41,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 00:13:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:41,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 00:13:41,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-03-31 00:13:41,713 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-03-31 00:13:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:41,797 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2023-03-31 00:13:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 00:13:41,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2023-03-31 00:13:41,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:41,800 INFO L225 Difference]: With dead ends: 79 [2023-03-31 00:13:41,800 INFO L226 Difference]: Without dead ends: 58 [2023-03-31 00:13:41,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-03-31 00:13:41,801 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 27 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:41,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 176 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:13:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-03-31 00:13:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2023-03-31 00:13:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-03-31 00:13:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-03-31 00:13:41,810 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 48 [2023-03-31 00:13:41,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:41,810 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-03-31 00:13:41,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-03-31 00:13:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-03-31 00:13:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-03-31 00:13:41,811 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:41,811 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:13:41,835 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-03-31 00:13:42,019 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-03-31 00:13:42,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:42,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:42,020 INFO L85 PathProgramCache]: Analyzing trace with hash 716210923, now seen corresponding path program 1 times [2023-03-31 00:13:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079864441] [2023-03-31 00:13:42,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:42,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:42,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:42,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:42,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:42,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 00:13:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-03-31 00:13:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-03-31 00:13:42,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:42,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079864441] [2023-03-31 00:13:42,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079864441] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:42,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366117429] [2023-03-31 00:13:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:42,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:42,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:42,184 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-03-31 00:13:42,206 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-03-31 00:13:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:42,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjunts are in the unsatisfiable core [2023-03-31 00:13:42,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:13:42,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-03-31 00:13:42,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:13:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-03-31 00:13:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366117429] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:13:42,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 00:13:42,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 10 [2023-03-31 00:13:42,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335048708] [2023-03-31 00:13:42,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 00:13:42,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 00:13:42,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:42,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 00:13:42,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-03-31 00:13:42,472 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-03-31 00:13:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:42,726 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-03-31 00:13:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-03-31 00:13:42,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 49 [2023-03-31 00:13:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:42,727 INFO L225 Difference]: With dead ends: 73 [2023-03-31 00:13:42,727 INFO L226 Difference]: Without dead ends: 60 [2023-03-31 00:13:42,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-03-31 00:13:42,728 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 100 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:42,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 9 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 00:13:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-03-31 00:13:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2023-03-31 00:13:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-03-31 00:13:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-03-31 00:13:42,737 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 49 [2023-03-31 00:13:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:42,737 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-03-31 00:13:42,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-03-31 00:13:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-03-31 00:13:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-03-31 00:13:42,738 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:42,738 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:13:42,757 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-03-31 00:13:42,944 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-03-31 00:13:42,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:42,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2051292363, now seen corresponding path program 2 times [2023-03-31 00:13:42,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:42,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496906001] [2023-03-31 00:13:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:42,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:43,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:43,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:43,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 00:13:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:43,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 00:13:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-03-31 00:13:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-03-31 00:13:43,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496906001] [2023-03-31 00:13:43,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496906001] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:13:43,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:13:43,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 00:13:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337673103] [2023-03-31 00:13:43,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:13:43,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 00:13:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:43,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 00:13:43,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-03-31 00:13:43,211 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-03-31 00:13:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:43,505 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2023-03-31 00:13:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-03-31 00:13:43,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2023-03-31 00:13:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:43,506 INFO L225 Difference]: With dead ends: 75 [2023-03-31 00:13:43,506 INFO L226 Difference]: Without dead ends: 63 [2023-03-31 00:13:43,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-03-31 00:13:43,507 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 96 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:43,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 13 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 00:13:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-03-31 00:13:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2023-03-31 00:13:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-03-31 00:13:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2023-03-31 00:13:43,516 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 57 [2023-03-31 00:13:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:43,516 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2023-03-31 00:13:43,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-03-31 00:13:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2023-03-31 00:13:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-03-31 00:13:43,517 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:43,517 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:13:43,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-31 00:13:43,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:43,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1040826720, now seen corresponding path program 1 times [2023-03-31 00:13:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:43,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038584530] [2023-03-31 00:13:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:44,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:44,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:45,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 00:13:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:45,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 00:13:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-03-31 00:13:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-03-31 00:13:45,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:45,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038584530] [2023-03-31 00:13:45,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038584530] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:45,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553398693] [2023-03-31 00:13:45,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:45,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:45,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:45,605 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-03-31 00:13:45,617 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-03-31 00:13:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:45,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 118 conjunts are in the unsatisfiable core [2023-03-31 00:13:45,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:13:45,802 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-03-31 00:13:45,976 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-03-31 00:13:45,976 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-03-31 00:13:46,028 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-03-31 00:13:46,098 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 00:13:46,099 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-03-31 00:13:46,409 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-03-31 00:13:46,416 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-03-31 00:13:46,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2023-03-31 00:13:46,442 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 15 treesize of output 13 [2023-03-31 00:13:46,557 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 00:13:46,557 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 36 treesize of output 37 [2023-03-31 00:13:46,689 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_743 (Array Int Int))) (= (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| v_ArrVal_743) |c_#memory_int|)) (exists ((v_ArrVal_741 Int) (sll_circular_update_at_~head.offset Int) (v_ArrVal_744 Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (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|) .cse0 v_ArrVal_744))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 v_ArrVal_741))) (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset))))) is different from true [2023-03-31 00:13:46,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:13:46,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-03-31 00:13:46,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:13:46,752 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 39 treesize of output 34 [2023-03-31 00:13:46,756 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 24 treesize of output 26 [2023-03-31 00:13:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-03-31 00:13:47,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:13:47,663 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| c_main_~s~0.base)) (.cse3 (select |c_#memory_$Pointer$.offset| c_main_~s~0.base)) (.cse0 (* 2 c_main_~len~0))) (and (forall ((v_sll_circular_update_at_~head.offset_12 Int)) (or (< v_sll_circular_update_at_~head.offset_12 c_main_~s~0.offset) (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 Int) (v_ArrVal_755 Int)) (<= .cse0 (+ (let ((.cse2 (+ v_sll_circular_update_at_~head.offset_12 4))) (select (select (store |c_#memory_int| c_main_~s~0.base v_ArrVal_754) (select (store .cse1 .cse2 v_ArrVal_756) c_main_~s~0.offset)) (+ (select (store .cse3 .cse2 v_ArrVal_755) c_main_~s~0.offset) 4))) 1))))) (forall ((v_sll_circular_update_at_~head.offset_12 Int)) (or (< v_sll_circular_update_at_~head.offset_12 c_main_~s~0.offset) (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 Int) (v_ArrVal_755 Int)) (< (let ((.cse4 (+ v_sll_circular_update_at_~head.offset_12 4))) (select (select (store |c_#memory_int| c_main_~s~0.base v_ArrVal_754) (select (store .cse1 .cse4 v_ArrVal_756) c_main_~s~0.offset)) (+ (select (store .cse3 .cse4 v_ArrVal_755) c_main_~s~0.offset) 4))) .cse0)))))) is different from false [2023-03-31 00:13:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553398693] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:47,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:13:47,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 57 [2023-03-31 00:13:47,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627663074] [2023-03-31 00:13:47,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 00:13:47,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-03-31 00:13:47,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:47,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-03-31 00:13:47,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3552, Unknown=39, NotChecked=242, Total=4032 [2023-03-31 00:13:47,673 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 57 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 44 states have internal predecessors, (79), 10 states have call successors, (15), 7 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2023-03-31 00:13:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:50,645 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2023-03-31 00:13:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-03-31 00:13:50,645 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 44 states have internal predecessors, (79), 10 states have call successors, (15), 7 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) Word has length 58 [2023-03-31 00:13:50,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:50,646 INFO L225 Difference]: With dead ends: 121 [2023-03-31 00:13:50,647 INFO L226 Difference]: Without dead ends: 119 [2023-03-31 00:13:50,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2082 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=595, Invalid=8451, Unknown=82, NotChecked=378, Total=9506 [2023-03-31 00:13:50,650 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 266 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:50,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 49 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2574 Invalid, 0 Unknown, 136 Unchecked, 1.4s Time] [2023-03-31 00:13:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-03-31 00:13:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2023-03-31 00:13:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 78 states have internal predecessors, (86), 14 states have call successors, (14), 7 states have call predecessors, (14), 12 states have return successors, (24), 13 states have call predecessors, (24), 13 states have call successors, (24) [2023-03-31 00:13:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2023-03-31 00:13:50,672 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 58 [2023-03-31 00:13:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:50,672 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2023-03-31 00:13:50,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 44 states have internal predecessors, (79), 10 states have call successors, (15), 7 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2023-03-31 00:13:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2023-03-31 00:13:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-03-31 00:13:50,677 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:50,677 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:13:50,697 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-03-31 00:13:50,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:50,883 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:50,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash 218837141, now seen corresponding path program 2 times [2023-03-31 00:13:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:50,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754150949] [2023-03-31 00:13:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:50,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:50,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 00:13:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 00:13:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-03-31 00:13:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-03-31 00:13:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754150949] [2023-03-31 00:13:51,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754150949] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769687212] [2023-03-31 00:13:51,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-31 00:13:51,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:51,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:51,122 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-03-31 00:13:51,123 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-03-31 00:13:51,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-31 00:13:51,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 00:13:51,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjunts are in the unsatisfiable core [2023-03-31 00:13:51,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:13:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-03-31 00:13:51,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:13:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-03-31 00:13:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769687212] provided 1 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:51,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:13:51,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 15 [2023-03-31 00:13:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922186347] [2023-03-31 00:13:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:13:51,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-03-31 00:13:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:51,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-03-31 00:13:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-03-31 00:13:51,424 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-03-31 00:13:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:51,476 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2023-03-31 00:13:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-31 00:13:51,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2023-03-31 00:13:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:51,478 INFO L225 Difference]: With dead ends: 137 [2023-03-31 00:13:51,479 INFO L226 Difference]: Without dead ends: 95 [2023-03-31 00:13:51,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-03-31 00:13:51,481 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:51,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 142 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:13:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-03-31 00:13:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-03-31 00:13:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 74 states have internal predecessors, (80), 14 states have call successors, (14), 7 states have call predecessors, (14), 11 states have return successors, (22), 13 states have call predecessors, (22), 13 states have call successors, (22) [2023-03-31 00:13:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2023-03-31 00:13:51,503 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 59 [2023-03-31 00:13:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:51,504 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2023-03-31 00:13:51,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-03-31 00:13:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2023-03-31 00:13:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-03-31 00:13:51,506 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:51,506 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:13:51,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-03-31 00:13:51,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:51,712 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:51,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:51,713 INFO L85 PathProgramCache]: Analyzing trace with hash 372071330, now seen corresponding path program 3 times [2023-03-31 00:13:51,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:51,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774442261] [2023-03-31 00:13:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:51,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 00:13:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 00:13:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-03-31 00:13:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-03-31 00:13:51,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774442261] [2023-03-31 00:13:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774442261] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773318280] [2023-03-31 00:13:51,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 00:13:51,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:51,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:51,835 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-03-31 00:13:51,857 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-03-31 00:13:52,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-03-31 00:13:52,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 00:13:52,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-31 00:13:52,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:13:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-03-31 00:13:52,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:13:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-03-31 00:13:52,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773318280] provided 1 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:52,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:13:52,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2023-03-31 00:13:52,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917317530] [2023-03-31 00:13:52,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:13:52,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 00:13:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:52,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 00:13:52,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-03-31 00:13:52,217 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-03-31 00:13:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:52,247 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2023-03-31 00:13:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 00:13:52,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2023-03-31 00:13:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:52,252 INFO L225 Difference]: With dead ends: 116 [2023-03-31 00:13:52,252 INFO L226 Difference]: Without dead ends: 97 [2023-03-31 00:13:52,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-03-31 00:13:52,255 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:52,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 161 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:13:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-03-31 00:13:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2023-03-31 00:13:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 74 states have internal predecessors, (80), 14 states have call successors, (14), 7 states have call predecessors, (14), 11 states have return successors, (22), 13 states have call predecessors, (22), 13 states have call successors, (22) [2023-03-31 00:13:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2023-03-31 00:13:52,272 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 59 [2023-03-31 00:13:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:52,272 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2023-03-31 00:13:52,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-03-31 00:13:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2023-03-31 00:13:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-03-31 00:13:52,273 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:52,273 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:13:52,295 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-03-31 00:13:52,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:52,474 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:52,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:52,474 INFO L85 PathProgramCache]: Analyzing trace with hash 856277198, now seen corresponding path program 4 times [2023-03-31 00:13:52,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:52,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448006016] [2023-03-31 00:13:52,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:52,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:52,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:52,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:52,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:52,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 00:13:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:52,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-03-31 00:13:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-03-31 00:13:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-31 00:13:52,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:52,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448006016] [2023-03-31 00:13:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448006016] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351472322] [2023-03-31 00:13:52,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-31 00:13:52,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:52,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:52,655 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-03-31 00:13:52,671 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-03-31 00:13:52,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-31 00:13:52,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 00:13:52,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 6 conjunts are in the unsatisfiable core [2023-03-31 00:13:52,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:13:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-03-31 00:13:52,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:13:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-31 00:13:53,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351472322] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:13:53,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 00:13:53,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2023-03-31 00:13:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780210843] [2023-03-31 00:13:53,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 00:13:53,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-03-31 00:13:53,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:53,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-03-31 00:13:53,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-03-31 00:13:53,043 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 6 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2023-03-31 00:13:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:53,397 INFO L93 Difference]: Finished difference Result 139 states and 166 transitions. [2023-03-31 00:13:53,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-03-31 00:13:53,398 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 6 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 59 [2023-03-31 00:13:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:53,399 INFO L225 Difference]: With dead ends: 139 [2023-03-31 00:13:53,399 INFO L226 Difference]: Without dead ends: 98 [2023-03-31 00:13:53,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2023-03-31 00:13:53,399 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 125 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:53,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 13 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 00:13:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-03-31 00:13:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-03-31 00:13:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 70 states have internal predecessors, (75), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (18), 13 states have call predecessors, (18), 13 states have call successors, (18) [2023-03-31 00:13:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2023-03-31 00:13:53,408 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 59 [2023-03-31 00:13:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:53,408 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2023-03-31 00:13:53,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 6 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2023-03-31 00:13:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2023-03-31 00:13:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-03-31 00:13:53,409 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:53,409 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:13:53,418 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-03-31 00:13:53,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:53,618 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:53,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash 547250552, now seen corresponding path program 5 times [2023-03-31 00:13:53,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:53,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242477282] [2023-03-31 00:13:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:53,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:53,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-03-31 00:13:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-03-31 00:13:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:53,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-03-31 00:13:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:53,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 00:13:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-03-31 00:13:53,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242477282] [2023-03-31 00:13:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242477282] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135271187] [2023-03-31 00:13:53,768 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-03-31 00:13:53,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:53,769 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-03-31 00:13:53,794 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-03-31 00:13:54,006 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-03-31 00:13:54,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 00:13:54,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-31 00:13:54,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:13:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-03-31 00:13:54,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:13:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-03-31 00:13:54,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135271187] provided 1 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:54,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:13:54,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 6] total 13 [2023-03-31 00:13:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484180832] [2023-03-31 00:13:54,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:13:54,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 00:13:54,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:54,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 00:13:54,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-03-31 00:13:54,153 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-03-31 00:13:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:54,183 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2023-03-31 00:13:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 00:13:54,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 66 [2023-03-31 00:13:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:54,184 INFO L225 Difference]: With dead ends: 124 [2023-03-31 00:13:54,184 INFO L226 Difference]: Without dead ends: 82 [2023-03-31 00:13:54,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-03-31 00:13:54,184 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:54,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 154 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:13:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-03-31 00:13:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-03-31 00:13:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-03-31 00:13:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2023-03-31 00:13:54,192 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 66 [2023-03-31 00:13:54,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:54,192 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2023-03-31 00:13:54,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-03-31 00:13:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2023-03-31 00:13:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-03-31 00:13:54,193 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:54,193 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2023-03-31 00:13:54,199 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-03-31 00:13:54,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:54,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:54,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1289704296, now seen corresponding path program 6 times [2023-03-31 00:13:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61024915] [2023-03-31 00:13:54,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:54,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:54,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:54,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:54,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 00:13:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:54,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 00:13:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:54,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 00:13:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:54,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-03-31 00:13:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-03-31 00:13:54,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:54,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61024915] [2023-03-31 00:13:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61024915] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:54,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482440563] [2023-03-31 00:13:54,544 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-03-31 00:13:54,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:54,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:54,545 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-03-31 00:13:54,547 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-03-31 00:13:54,964 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-03-31 00:13:54,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 00:13:54,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjunts are in the unsatisfiable core [2023-03-31 00:13:54,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:13:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-03-31 00:13:55,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:13:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-03-31 00:13:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482440563] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:13:55,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 00:13:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2023-03-31 00:13:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105141121] [2023-03-31 00:13:55,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 00:13:55,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-03-31 00:13:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:55,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-03-31 00:13:55,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-03-31 00:13:55,103 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 11 states have internal predecessors, (62), 7 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2023-03-31 00:13:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:55,422 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2023-03-31 00:13:55,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-31 00:13:55,422 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 11 states have internal predecessors, (62), 7 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 67 [2023-03-31 00:13:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:55,423 INFO L225 Difference]: With dead ends: 96 [2023-03-31 00:13:55,423 INFO L226 Difference]: Without dead ends: 63 [2023-03-31 00:13:55,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2023-03-31 00:13:55,424 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 136 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:55,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 13 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 00:13:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-03-31 00:13:55,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2023-03-31 00:13:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-03-31 00:13:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-03-31 00:13:55,430 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 67 [2023-03-31 00:13:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:55,430 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-03-31 00:13:55,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 11 states have internal predecessors, (62), 7 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2023-03-31 00:13:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-03-31 00:13:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-03-31 00:13:55,431 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:55,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-03-31 00:13:55,453 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-03-31 00:13:55,638 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,SelfDestructingSolverStorable10 [2023-03-31 00:13:55,639 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:55,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1729031691, now seen corresponding path program 1 times [2023-03-31 00:13:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372329458] [2023-03-31 00:13:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:56,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:56,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:56,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 00:13:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:56,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 00:13:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:56,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-03-31 00:13:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-03-31 00:13:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-03-31 00:13:56,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:56,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372329458] [2023-03-31 00:13:56,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372329458] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:56,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137342400] [2023-03-31 00:13:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:56,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:56,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:56,404 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-03-31 00:13:56,433 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-03-31 00:13:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:56,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 57 conjunts are in the unsatisfiable core [2023-03-31 00:13:56,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:13:56,737 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-03-31 00:13:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-31 00:13:57,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:13:57,533 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 46 treesize of output 40 [2023-03-31 00:13:57,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:13:57,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:13:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-31 00:13:57,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137342400] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:13:57,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 00:13:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 14] total 48 [2023-03-31 00:13:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375234082] [2023-03-31 00:13:57,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 00:13:57,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-03-31 00:13:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:13:57,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-03-31 00:13:57,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2108, Unknown=0, NotChecked=0, Total=2256 [2023-03-31 00:13:57,749 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 48 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 14 states have call successors, (22), 5 states have call predecessors, (22), 10 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2023-03-31 00:13:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:13:59,402 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2023-03-31 00:13:59,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-03-31 00:13:59,403 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 14 states have call successors, (22), 5 states have call predecessors, (22), 10 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) Word has length 68 [2023-03-31 00:13:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:13:59,403 INFO L225 Difference]: With dead ends: 76 [2023-03-31 00:13:59,403 INFO L226 Difference]: Without dead ends: 72 [2023-03-31 00:13:59,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=424, Invalid=4832, Unknown=0, NotChecked=0, Total=5256 [2023-03-31 00:13:59,405 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 227 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-31 00:13:59,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 61 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1858 Invalid, 1 Unknown, 0 Unchecked, 0.9s Time] [2023-03-31 00:13:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-03-31 00:13:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2023-03-31 00:13:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 51 states have internal predecessors, (53), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-03-31 00:13:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2023-03-31 00:13:59,416 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 68 [2023-03-31 00:13:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:13:59,416 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2023-03-31 00:13:59,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 14 states have call successors, (22), 5 states have call predecessors, (22), 10 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2023-03-31 00:13:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2023-03-31 00:13:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-03-31 00:13:59,416 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:13:59,416 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2023-03-31 00:13:59,425 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-03-31 00:13:59,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:59,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:13:59,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:13:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash 185101962, now seen corresponding path program 2 times [2023-03-31 00:13:59,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:13:59,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875643169] [2023-03-31 00:13:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:13:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:13:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:13:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 00:13:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:59,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 00:13:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 00:13:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 00:13:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:59,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 00:13:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:59,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-03-31 00:13:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:59,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-03-31 00:13:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:13:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-03-31 00:13:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:13:59,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875643169] [2023-03-31 00:13:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875643169] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:13:59,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828056249] [2023-03-31 00:13:59,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-31 00:13:59,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:13:59,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:13:59,763 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-03-31 00:13:59,820 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-03-31 00:14:00,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-31 00:14:00,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 00:14:00,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjunts are in the unsatisfiable core [2023-03-31 00:14:00,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:14:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-03-31 00:14:00,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:14:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-03-31 00:14:00,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828056249] provided 1 perfect and 1 imperfect interpolant sequences [2023-03-31 00:14:00,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:14:00,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 15 [2023-03-31 00:14:00,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891625128] [2023-03-31 00:14:00,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:14:00,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-03-31 00:14:00,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:14:00,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-03-31 00:14:00,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-03-31 00:14:00,173 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-03-31 00:14:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:14:00,236 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-03-31 00:14:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-31 00:14:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 69 [2023-03-31 00:14:00,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:14:00,238 INFO L225 Difference]: With dead ends: 85 [2023-03-31 00:14:00,238 INFO L226 Difference]: Without dead ends: 0 [2023-03-31 00:14:00,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 143 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-03-31 00:14:00,239 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:14:00,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 211 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:14:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-03-31 00:14:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-03-31 00:14:00,240 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-03-31 00:14:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-03-31 00:14:00,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2023-03-31 00:14:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:14:00,240 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-03-31 00:14:00,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-03-31 00:14:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-03-31 00:14:00,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-03-31 00:14:00,242 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-31 00:14:00,263 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-03-31 00:14:00,449 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,SelfDestructingSolverStorable12 [2023-03-31 00:14:00,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-03-31 00:14:01,153 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2023-03-31 00:14:01,154 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2023-03-31 00:14:01,154 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 12) no Hoare annotation was computed. [2023-03-31 00:14:01,154 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-03-31 00:14:01,154 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 571 573) the Hoare annotation is: true [2023-03-31 00:14:01,154 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 571 573) no Hoare annotation was computed. [2023-03-31 00:14:01,154 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 74 78) no Hoare annotation was computed. [2023-03-31 00:14:01,154 INFO L899 garLoopResultBuilder]: For program point __bswap_32FINAL(lines 74 78) no Hoare annotation was computed. [2023-03-31 00:14:01,154 INFO L899 garLoopResultBuilder]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2023-03-31 00:14:01,154 INFO L902 garLoopResultBuilder]: At program point L577(line 577) the Hoare annotation is: true [2023-03-31 00:14:01,154 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-03-31 00:14:01,154 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2023-03-31 00:14:01,154 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2023-03-31 00:14:01,154 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-03-31 00:14:01,154 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-03-31 00:14:01,155 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 620 639) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 620 639) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 620 639) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-03-31 00:14:01,155 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L899 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L895 garLoopResultBuilder]: At program point L631(line 631) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int| main_~s~0.base) 4))) (let ((.cse0 (<= 2 main_~new_data~0)) (.cse1 (<= .cse8 2)) (.cse4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) 0)) 4)) (.cse2 (= main_~len~0 2)) (.cse3 (<= main_~new_data~0 2)) (.cse5 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse6 (<= 2 .cse8)) (.cse7 (= main_~s~0.offset 0))) (or (and .cse0 .cse1 (<= main_~expected~0 3) (= main_~i~0 1) .cse2 .cse3 (= .cse4 3) .cse5 .cse6 (<= 3 main_~expected~0) .cse7) (and .cse0 (<= .cse4 3) .cse1 (<= 3 .cse4) .cse2 .cse3 (= main_~i~0 0) .cse5 (= 2 main_~expected~0) .cse6 .cse7)))) [2023-03-31 00:14:01,155 INFO L899 garLoopResultBuilder]: For program point L631-1(line 631) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L899 garLoopResultBuilder]: For program point L631-2(lines 631 633) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L895 garLoopResultBuilder]: At program point L627(line 627) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$.base| main_~s~0.base) 0))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse2 (not (= .cse5 main_~s~0.base))) (.cse3 (= main_~s~0.offset 0))) (or (and (<= 3 main_~new_data~0) (<= main_~new_data~0 3) (= main_~i~0 1) .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (select (select |#memory_int| .cse5) 4))) (and (<= 2 main_~new_data~0) (<= .cse4 3) (<= 3 .cse4) .cse0 (<= main_~new_data~0 2) (= main_~i~0 0) .cse1 .cse2 .cse3))))) [2023-03-31 00:14:01,155 INFO L899 garLoopResultBuilder]: For program point L629-2(lines 629 634) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L899 garLoopResultBuilder]: For program point L627-1(lines 625 628) no Hoare annotation was computed. [2023-03-31 00:14:01,155 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse9 (select (select |#memory_int| main_~s~0.base) 4)) (.cse10 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) 0)) 4))) (let ((.cse0 (<= 2 main_~new_data~0)) (.cse1 (<= .cse10 3)) (.cse2 (<= .cse9 2)) (.cse3 (<= 3 .cse10)) (.cse4 (= main_~len~0 2)) (.cse5 (<= main_~new_data~0 2)) (.cse6 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse7 (<= 2 .cse9)) (.cse8 (= main_~s~0.offset 0))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 main_~expected~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= main_~i~0 0) .cse6 .cse7 .cse8)) (<= main_~i~0 0)) (and .cse0 .cse1 .cse2 .cse3 (= main_~i~0 1) .cse4 .cse5 .cse6 .cse7 .cse8)))) [2023-03-31 00:14:01,155 INFO L895 garLoopResultBuilder]: At program point L629-4(lines 629 634) the Hoare annotation is: (= main_~len~0 2) [2023-03-31 00:14:01,156 INFO L895 garLoopResultBuilder]: At program point L623(line 623) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#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-03-31 00:14:01,156 INFO L895 garLoopResultBuilder]: At program point L625-2(lines 625 628) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) 0))) (let ((.cse7 (select (select |#memory_int| .cse8) 4))) (let ((.cse2 (not (= .cse8 main_~s~0.base))) (.cse4 (<= .cse7 3)) (.cse5 (<= 3 .cse7)) (.cse0 (= main_~len~0 2)) (.cse1 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 0) 0)) (.cse3 (= main_~s~0.offset 0))) (or (and (= main_~i~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 (= main_~i~0 0) .cse1 (= 3 main_~new_data~0) .cse2 .cse3) (let ((.cse6 (select (select |#memory_int| main_~s~0.base) 4))) (and (<= 2 main_~new_data~0) .cse4 (<= .cse6 2) .cse5 (<= main_~i~0 0) .cse0 (<= main_~new_data~0 2) .cse1 (<= 2 .cse6) .cse3)))))) [2023-03-31 00:14:01,156 INFO L899 garLoopResultBuilder]: For program point L623-1(line 623) no Hoare annotation was computed. [2023-03-31 00:14:01,156 INFO L899 garLoopResultBuilder]: For program point L625-3(lines 625 628) no Hoare annotation was computed. [2023-03-31 00:14:01,156 INFO L895 garLoopResultBuilder]: At program point ERROR(lines 620 639) the Hoare annotation is: false [2023-03-31 00:14:01,156 INFO L899 garLoopResultBuilder]: For program point sll_circular_update_atEXIT(lines 613 619) no Hoare annotation was computed. [2023-03-31 00:14:01,156 INFO L899 garLoopResultBuilder]: For program point sll_circular_update_atFINAL(lines 613 619) no Hoare annotation was computed. [2023-03-31 00:14:01,156 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-03-31 00:14:01,156 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse3 (<= (+ sll_circular_update_at_~index 1) |sll_circular_update_at_#in~index|)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse4 (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data)) (.cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (and (<= 2 |sll_circular_update_at_#in~index|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 (= (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|)) (<= 1 |sll_circular_update_at_#in~index|) .cse1 .cse2 .cse3) (and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) .cse0 .cse4 .cse1 .cse2 (= |sll_circular_update_at_#in~index| sll_circular_update_at_~index) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|)))) [2023-03-31 00:14:01,156 INFO L899 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2023-03-31 00:14:01,156 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2023-03-31 00:14:01,156 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2023-03-31 00:14:01,156 INFO L899 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2023-03-31 00:14:01,156 INFO L899 garLoopResultBuilder]: For program point L596-2(lines 595 605) no Hoare annotation was computed. [2023-03-31 00:14:01,156 INFO L899 garLoopResultBuilder]: For program point sll_circular_destroyEXIT(lines 595 605) no Hoare annotation was computed. [2023-03-31 00:14:01,156 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 595 605) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-03-31 00:14:01,156 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 79 83) no Hoare annotation was computed. [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point __bswap_64FINAL(lines 79 83) no Hoare annotation was computed. [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point sll_circular_createFINAL(lines 583 594) no Hoare annotation was computed. [2023-03-31 00:14:01,157 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) (= (select |#valid| sll_circular_create_~last~0.base) 1) (< sll_circular_create_~len 3))) [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point sll_circular_createEXIT(lines 583 594) no Hoare annotation was computed. [2023-03-31 00:14:01,157 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 583 594) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-03-31 00:14:01,157 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |sll_circular_create_#in~len| sll_circular_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-03-31 00:14:01,157 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= sll_circular_create_~head~0.offset 0)) (.cse1 (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base))) (or (<= 3 |sll_circular_create_#in~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) (not .cse1)) (and .cse0 .cse1 (= |sll_circular_create_#in~len| sll_circular_create_~len) (= (select |#valid| sll_circular_create_~last~0.base) 1)))) [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point sll_circular_get_data_atEXIT(lines 606 612) no Hoare annotation was computed. [2023-03-31 00:14:01,157 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (or (forall ((v_main_~s~0.offset_BEFORE_CALL_3 Int) (v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) v_main_~s~0.offset_BEFORE_CALL_3))) (or (< 0 v_main_~s~0.offset_BEFORE_CALL_3) (not (= (select (select |#memory_int| .cse0) (+ (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) v_main_~s~0.offset_BEFORE_CALL_3) 4)) 3)) (= v_main_~s~0.base_BEFORE_CALL_3 .cse0) (< v_main_~s~0.offset_BEFORE_CALL_3 0)))) (and (<= sll_circular_get_data_at_~index 0) (= 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.offset_BEFORE_CALL_5 Int) (v_main_~s~0.base_BEFORE_CALL_5 Int)) (not (= 2 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_5) (+ v_main_~s~0.offset_BEFORE_CALL_5 4))))) (and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|)) (<= 2 |sll_circular_get_data_at_#in~index|)) [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2023-03-31 00:14:01,157 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 606 612) the Hoare annotation is: true [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point sll_circular_get_data_atFINAL(lines 606 612) no Hoare annotation was computed. [2023-03-31 00:14:01,157 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-03-31 00:14:01,158 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-03-31 00:14:01,158 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-03-31 00:14:01,158 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-03-31 00:14:01,160 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1] [2023-03-31 00:14:01,162 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-31 00:14:01,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,191 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,202 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,204 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,213 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,213 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,213 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,213 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-03-31 00:14:01,214 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-03-31 00:14:01,215 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,215 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,215 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,215 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-03-31 00:14:01,216 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-03-31 00:14:01,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.03 12:14:01 BoogieIcfgContainer [2023-03-31 00:14:01,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-31 00:14:01,237 INFO L158 Benchmark]: Toolchain (without parser) took 22346.75ms. Allocated memory was 188.7MB in the beginning and 463.5MB in the end (delta: 274.7MB). Free memory was 138.7MB in the beginning and 323.8MB in the end (delta: -185.1MB). Peak memory consumption was 261.5MB. Max. memory is 8.0GB. [2023-03-31 00:14:01,237 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-03-31 00:14:01,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.23ms. Allocated memory is still 188.7MB. Free memory was 138.3MB in the beginning and 121.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-03-31 00:14:01,237 INFO L158 Benchmark]: Boogie Preprocessor took 36.41ms. Allocated memory is still 188.7MB. Free memory was 121.3MB in the beginning and 118.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-03-31 00:14:01,237 INFO L158 Benchmark]: RCFGBuilder took 448.00ms. Allocated memory is still 188.7MB. Free memory was 118.4MB in the beginning and 94.7MB in the end (delta: 23.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-03-31 00:14:01,238 INFO L158 Benchmark]: TraceAbstraction took 21524.90ms. Allocated memory was 188.7MB in the beginning and 463.5MB in the end (delta: 274.7MB). Free memory was 94.0MB in the beginning and 323.8MB in the end (delta: -229.8MB). Peak memory consumption was 217.4MB. Max. memory is 8.0GB. [2023-03-31 00:14:01,238 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.14ms. Allocated memory is still 188.7MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 333.23ms. Allocated memory is still 188.7MB. Free memory was 138.3MB in the beginning and 121.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.41ms. Allocated memory is still 188.7MB. Free memory was 121.3MB in the beginning and 118.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 448.00ms. Allocated memory is still 188.7MB. Free memory was 118.4MB in the beginning and 94.7MB in the end (delta: 23.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 21524.90ms. Allocated memory was 188.7MB in the beginning and 463.5MB in the end (delta: 274.7MB). Free memory was 94.0MB in the beginning and 323.8MB in the end (delta: -229.8MB). Peak memory consumption was 217.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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$.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$.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$.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$.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$.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$.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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,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_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,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_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,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_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,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_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,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_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,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_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,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_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,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_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,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 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$.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$.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 * 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, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1218 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1202 mSDsluCounter, 1025 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 136 IncrementalHoareTripleChecker+Unchecked, 779 mSDsCounter, 381 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6312 IncrementalHoareTripleChecker+Invalid, 6830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 381 mSolverCounterUnsat, 246 mSDtfsCounter, 6312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1505 GetRequests, 1149 SyntacticMatches, 27 SemanticMatches, 329 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3772 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=6, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 66 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 81 PreInvPairs, 119 NumberOfFragments, 855 HoareAnnotationTreeSize, 81 FomulaSimplifications, 3049 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 948 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1333 NumberOfCodeBlocks, 1330 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1798 ConstructedInterpolants, 21 QuantifiedInterpolants, 6885 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3721 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 31 InterpolantComputations, 8 PerfectInterpolantSequences, 585/700 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-03-31 00:14:01,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((i == 1 && len == 2) && #memory_$Pointer$[s][0] == 0) && !(#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]) && len == 2) && i == 0) && #memory_$Pointer$[s][0] == 0) && 3 == new_data) && !(#memory_$Pointer$[s][0] == s)) && s == 0)) || (((((((((2 <= new_data && unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3) && unknown-#memory_int-unknown[s][4] <= 2) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && i <= 0) && len == 2) && new_data <= 2) && #memory_$Pointer$[s][0] == 0) && 2 <= unknown-#memory_int-unknown[s][4]) && s == 0) - InvariantResult [Line: 614]: Loop Invariant [2023-03-31 00:14:01,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((2 <= \old(index) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && index + 1 <= \old(index)) || (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(data) == data) && #memory_$Pointer$[head][head] == head) && head == #memory_$Pointer$[head][head]) && 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && index + 1 <= \old(index))) || ((((((head == head && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(data) == data) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(index) == index) && head == head) - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2023-03-31 00:14:01,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (3 <= \old(len) || ((((last == #memory_$Pointer$[head][0] && head == 0) && #memory_$Pointer$[head][0] == 0) && len <= 1) && !(head == last))) || (((head == 0 && head == last) && \old(len) == len) && \valid[last] == 1) - InvariantResult [Line: 607]: Loop Invariant [2023-03-31 00:14:01,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-03-31 00:14:01,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_5,QUANTIFIED] [2023-03-31 00:14:01,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_5,QUANTIFIED] Derived loop invariant: ((((forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: ((0 < v_main_~s~0.offset_BEFORE_CALL_3 || !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] + 4] == 3)) || v_main_~s~0.base_BEFORE_CALL_3 == #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3]) || v_main_~s~0.offset_BEFORE_CALL_3 < 0) || (((index <= 0 && head == #memory_$Pointer$[head][head]) && 1 <= \old(index)) && #memory_$Pointer$[head][head] == head)) || (forall v_main_~s~0.offset_BEFORE_CALL_5 : int, v_main_~s~0.base_BEFORE_CALL_5 : int :: !(2 == unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_5][v_main_~s~0.offset_BEFORE_CALL_5 + 4]))) || ((head == head && index == \old(index)) && head == head)) || 2 <= \old(index) - InvariantResult [Line: 629]: Loop Invariant [2023-03-31 00:14:01,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-03-31 00:14:01,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-03-31 00:14:01,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((2 <= new_data && unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3) && unknown-#memory_int-unknown[s][4] <= 2) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && len == 2) && new_data <= 2) && #memory_$Pointer$[s][0] == 0) && 2 == expected) && 2 <= unknown-#memory_int-unknown[s][4]) && s == 0) || (((((((((2 <= new_data && unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3) && unknown-#memory_int-unknown[s][4] <= 2) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && len == 2) && new_data <= 2) && i == 0) && #memory_$Pointer$[s][0] == 0) && 2 <= unknown-#memory_int-unknown[s][4]) && s == 0)) && i <= 0) || (((((((((2 <= new_data && unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4] <= 3) && unknown-#memory_int-unknown[s][4] <= 2) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][4]) && i == 1) && len == 2) && new_data <= 2) && #memory_$Pointer$[s][0] == 0) && 2 <= unknown-#memory_int-unknown[s][4]) && 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-03-31 00:14:01,273 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...