./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:23:59,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:23:59,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:23:59,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:23:59,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:23:59,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:23:59,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:23:59,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:23:59,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:23:59,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:23:59,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:23:59,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:23:59,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:23:59,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:23:59,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:23:59,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:23:59,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:23:59,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:23:59,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:23:59,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:23:59,083 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:23:59,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:23:59,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:23:59,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:23:59,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:23:59,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:23:59,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:23:59,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:23:59,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:23:59,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:23:59,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:23:59,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:23:59,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:23:59,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:23:59,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:23:59,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:23:59,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:23:59,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:23:59,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:23:59,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:23:59,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:23:59,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:23:59,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:23:59,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:23:59,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:23:59,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:23:59,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:23:59,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:23:59,135 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:23:59,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:23:59,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:23:59,136 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:23:59,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:23:59,137 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:23:59,138 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:23:59,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:23:59,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:23:59,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:23:59,139 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:23:59,139 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:23:59,139 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:23:59,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:23:59,139 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:23:59,140 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:23:59,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:23:59,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:23:59,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:23:59,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:23:59,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:23:59,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:23:59,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:23:59,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:23:59,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:23:59,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-07-20 06:23:59,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:23:59,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:23:59,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:23:59,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:23:59,397 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:23:59,398 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 [2022-07-20 06:23:59,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549aafbe3/5b8c45ff1f414b0e87f5535b07ac79b6/FLAG8b0d3151b [2022-07-20 06:23:59,873 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:23:59,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-07-20 06:23:59,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549aafbe3/5b8c45ff1f414b0e87f5535b07ac79b6/FLAG8b0d3151b [2022-07-20 06:23:59,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549aafbe3/5b8c45ff1f414b0e87f5535b07ac79b6 [2022-07-20 06:23:59,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:23:59,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:23:59,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:23:59,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:23:59,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:23:59,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:23:59" (1/1) ... [2022-07-20 06:23:59,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332951bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:59, skipping insertion in model container [2022-07-20 06:23:59,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:23:59" (1/1) ... [2022-07-20 06:23:59,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:23:59,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:24:00,185 WARN L230 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] [2022-07-20 06:24:00,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:24:00,201 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:24:00,267 WARN L230 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] [2022-07-20 06:24:00,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:24:00,298 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:24:00,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00 WrapperNode [2022-07-20 06:24:00,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:24:00,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:24:00,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:24:00,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:24:00,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (1/1) ... [2022-07-20 06:24:00,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (1/1) ... [2022-07-20 06:24:00,362 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-07-20 06:24:00,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:24:00,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:24:00,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:24:00,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:24:00,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (1/1) ... [2022-07-20 06:24:00,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (1/1) ... [2022-07-20 06:24:00,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (1/1) ... [2022-07-20 06:24:00,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (1/1) ... [2022-07-20 06:24:00,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (1/1) ... [2022-07-20 06:24:00,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (1/1) ... [2022-07-20 06:24:00,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (1/1) ... [2022-07-20 06:24:00,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:24:00,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:24:00,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:24:00,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:24:00,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (1/1) ... [2022-07-20 06:24:00,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:24:00,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:00,436 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) [2022-07-20 06:24:00,438 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 [2022-07-20 06:24:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:24:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:24:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-20 06:24:00,471 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-20 06:24:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:24:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:24:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:24:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:24:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:24:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:24:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:24:00,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:24:00,606 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:24:00,608 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:24:00,867 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:24:00,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:24:00,877 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-20 06:24:00,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:24:00 BoogieIcfgContainer [2022-07-20 06:24:00,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:24:00,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:24:00,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:24:00,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:24:00,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:23:59" (1/3) ... [2022-07-20 06:24:00,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3218c918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:24:00, skipping insertion in model container [2022-07-20 06:24:00,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:24:00" (2/3) ... [2022-07-20 06:24:00,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3218c918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:24:00, skipping insertion in model container [2022-07-20 06:24:00,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:24:00" (3/3) ... [2022-07-20 06:24:00,896 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-07-20 06:24:00,909 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:24:00,909 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-20 06:24:00,950 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:24:00,956 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@340da015, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ee98c58 [2022-07-20 06:24:00,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-20 06:24:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 06:24:00,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:00,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 06:24:00,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-07-20 06:24:00,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:00,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494204052] [2022-07-20 06:24:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:00,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:24:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:01,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494204052] [2022-07-20 06:24:01,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494204052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:01,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:24:01,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:24:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53636143] [2022-07-20 06:24:01,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:01,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:24:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:24:01,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:24:01,174 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:24:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:01,271 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-20 06:24:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:24:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 06:24:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:01,280 INFO L225 Difference]: With dead ends: 81 [2022-07-20 06:24:01,281 INFO L226 Difference]: Without dead ends: 78 [2022-07-20 06:24:01,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:24:01,288 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:01,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:24:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-20 06:24:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-20 06:24:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-07-20 06:24:01,321 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-07-20 06:24:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:01,321 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-07-20 06:24:01,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:24:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-07-20 06:24:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 06:24:01,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:01,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 06:24:01,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:24:01,323 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:01,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-07-20 06:24:01,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:01,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157013525] [2022-07-20 06:24:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:01,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:24:01,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:01,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157013525] [2022-07-20 06:24:01,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157013525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:01,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:24:01,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:24:01,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501182392] [2022-07-20 06:24:01,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:01,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:24:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:24:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:24:01,373 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:24:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:01,427 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-07-20 06:24:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:24:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 06:24:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:01,429 INFO L225 Difference]: With dead ends: 76 [2022-07-20 06:24:01,430 INFO L226 Difference]: Without dead ends: 76 [2022-07-20 06:24:01,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:24:01,432 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:01,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:24:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-20 06:24:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-20 06:24:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-20 06:24:01,449 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-07-20 06:24:01,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:01,449 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-20 06:24:01,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:24:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-20 06:24:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:24:01,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:01,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:24:01,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:24:01,451 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-07-20 06:24:01,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:01,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992845702] [2022-07-20 06:24:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:24:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:01,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992845702] [2022-07-20 06:24:01,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992845702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:01,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:24:01,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:24:01,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569386102] [2022-07-20 06:24:01,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:01,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:24:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:01,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:24:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:24:01,597 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:24:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:01,674 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-07-20 06:24:01,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:24:01,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-20 06:24:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:01,679 INFO L225 Difference]: With dead ends: 83 [2022-07-20 06:24:01,679 INFO L226 Difference]: Without dead ends: 83 [2022-07-20 06:24:01,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:24:01,680 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:01,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:24:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-20 06:24:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-07-20 06:24:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-07-20 06:24:01,696 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-07-20 06:24:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:01,697 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-07-20 06:24:01,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:24:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-07-20 06:24:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:24:01,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:01,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:24:01,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:24:01,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-07-20 06:24:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:01,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336653030] [2022-07-20 06:24:01,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:01,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:01,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:24:01,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:01,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336653030] [2022-07-20 06:24:01,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336653030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:01,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:24:01,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:24:01,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869541088] [2022-07-20 06:24:01,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:01,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:24:01,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:01,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:24:01,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:24:01,851 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:02,004 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-07-20 06:24:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:24:02,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-20 06:24:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:02,014 INFO L225 Difference]: With dead ends: 97 [2022-07-20 06:24:02,015 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 06:24:02,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:24:02,023 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:02,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:24:02,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 06:24:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-07-20 06:24:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-20 06:24:02,034 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-07-20 06:24:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:02,035 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-20 06:24:02,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-20 06:24:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:24:02,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:02,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:24:02,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:24:02,037 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-07-20 06:24:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:02,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764251454] [2022-07-20 06:24:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:24:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:02,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764251454] [2022-07-20 06:24:02,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764251454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:02,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:24:02,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:24:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359869553] [2022-07-20 06:24:02,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:02,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:24:02,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:02,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:24:02,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:24:02,212 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:02,343 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-07-20 06:24:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:24:02,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-20 06:24:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:02,345 INFO L225 Difference]: With dead ends: 76 [2022-07-20 06:24:02,345 INFO L226 Difference]: Without dead ends: 76 [2022-07-20 06:24:02,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:24:02,346 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:02,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:24:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-20 06:24:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-07-20 06:24:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-07-20 06:24:02,353 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-07-20 06:24:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:02,353 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-07-20 06:24:02,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-07-20 06:24:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:24:02,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:02,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:24:02,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:24:02,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-07-20 06:24:02,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:02,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167354675] [2022-07-20 06:24:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:02,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:02,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:02,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:24:02,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:02,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167354675] [2022-07-20 06:24:02,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167354675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:02,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665627990] [2022-07-20 06:24:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:02,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:02,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:02,527 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) [2022-07-20 06:24:02,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 06:24:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:02,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:24:02,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:02,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:02,908 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:24:02,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:24:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:24:02,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:03,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665627990] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:03,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:24:03,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-20 06:24:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741355352] [2022-07-20 06:24:03,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:24:03,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:24:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:24:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:24:03,011 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:24:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:03,142 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-07-20 06:24:03,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:24:03,143 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-07-20 06:24:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:03,144 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:24:03,144 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 06:24:03,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:24:03,145 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:03,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 355 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-07-20 06:24:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 06:24:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2022-07-20 06:24:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-07-20 06:24:03,155 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2022-07-20 06:24:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:03,155 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-07-20 06:24:03,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:24:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-07-20 06:24:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:24:03,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:03,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:24:03,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:24:03,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-20 06:24:03,378 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-07-20 06:24:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:03,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396227704] [2022-07-20 06:24:03,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:24:03,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:03,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396227704] [2022-07-20 06:24:03,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396227704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:03,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045442377] [2022-07-20 06:24:03,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:03,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:03,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:03,674 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) [2022-07-20 06:24:03,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 06:24:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:03,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 06:24:03,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:03,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:04,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:24:04,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:24:04,076 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:24:04,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:24:04,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:04,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045442377] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:04,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:24:04,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-07-20 06:24:04,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365133702] [2022-07-20 06:24:04,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:24:04,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 06:24:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 06:24:04,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:24:04,223 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:24:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:04,479 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-07-20 06:24:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:24:04,483 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-07-20 06:24:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:04,484 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:24:04,484 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 06:24:04,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-07-20 06:24:04,485 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 176 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:04,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 450 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 324 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-07-20 06:24:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 06:24:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-07-20 06:24:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-07-20 06:24:04,490 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2022-07-20 06:24:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:04,490 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-07-20 06:24:04,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:24:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-07-20 06:24:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:24:04,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:04,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:24:04,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:24:04,699 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,SelfDestructingSolverStorable6 [2022-07-20 06:24:04,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:04,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-07-20 06:24:04,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:04,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698920490] [2022-07-20 06:24:04,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:04,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:04,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:04,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:24:04,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698920490] [2022-07-20 06:24:04,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698920490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:04,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:24:04,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:24:04,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717253047] [2022-07-20 06:24:04,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:04,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:24:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:04,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:24:04,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:24:04,824 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:05,084 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-07-20 06:24:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:24:05,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-20 06:24:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:05,085 INFO L225 Difference]: With dead ends: 142 [2022-07-20 06:24:05,085 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 06:24:05,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:24:05,086 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:05,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:24:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 06:24:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2022-07-20 06:24:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-20 06:24:05,091 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2022-07-20 06:24:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:05,091 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-20 06:24:05,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-20 06:24:05,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:24:05,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:05,092 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:24:05,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:24:05,092 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:05,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:05,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2022-07-20 06:24:05,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:05,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661070673] [2022-07-20 06:24:05,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:05,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:24:05,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:05,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661070673] [2022-07-20 06:24:05,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661070673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:05,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953301402] [2022-07-20 06:24:05,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:05,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:05,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:05,200 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) [2022-07-20 06:24:05,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 06:24:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:05,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:24:05,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:24:05,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:24:05,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953301402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:05,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:24:05,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-20 06:24:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22664699] [2022-07-20 06:24:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:05,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:24:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:24:05,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:24:05,328 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:05,368 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-07-20 06:24:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:24:05,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-20 06:24:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:05,370 INFO L225 Difference]: With dead ends: 104 [2022-07-20 06:24:05,370 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 06:24:05,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:24:05,371 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 117 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:05,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 216 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:24:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 06:24:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-07-20 06:24:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-07-20 06:24:05,375 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 30 [2022-07-20 06:24:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:05,375 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-07-20 06:24:05,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-07-20 06:24:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:24:05,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:05,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:24:05,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:24:05,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:05,603 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:05,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2022-07-20 06:24:05,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:05,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065896240] [2022-07-20 06:24:05,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:05,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:24:05,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:05,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065896240] [2022-07-20 06:24:05,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065896240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:05,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:24:05,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:24:05,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525106194] [2022-07-20 06:24:05,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:05,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:24:05,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:05,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:24:05,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:24:05,751 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:06,008 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-07-20 06:24:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:24:06,009 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-20 06:24:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:06,010 INFO L225 Difference]: With dead ends: 127 [2022-07-20 06:24:06,010 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 06:24:06,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:24:06,011 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 307 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:06,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 500 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:24:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 06:24:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2022-07-20 06:24:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-07-20 06:24:06,015 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2022-07-20 06:24:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:06,015 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-07-20 06:24:06,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-07-20 06:24:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:24:06,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:06,016 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:24:06,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:24:06,024 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:06,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-07-20 06:24:06,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:06,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314456193] [2022-07-20 06:24:06,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:06,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:06,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:24:06,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:06,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314456193] [2022-07-20 06:24:06,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314456193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:06,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960129125] [2022-07-20 06:24:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:06,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:06,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:06,297 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) [2022-07-20 06:24:06,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 06:24:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:06,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 06:24:06,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:06,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:06,482 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:24:06,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:06,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:06,525 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:24:06,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-20 06:24:06,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-20 06:24:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:24:06,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:06,651 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-20 06:24:06,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-20 06:24:06,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-20 06:24:06,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-07-20 06:24:06,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:06,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-20 06:24:06,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 22 [2022-07-20 06:24:06,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-20 06:24:06,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960129125] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:06,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:24:06,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2022-07-20 06:24:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957208083] [2022-07-20 06:24:06,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:24:06,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 06:24:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:06,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 06:24:06,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=549, Unknown=2, NotChecked=94, Total=702 [2022-07-20 06:24:06,762 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:07,449 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-07-20 06:24:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:24:07,450 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-07-20 06:24:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:07,451 INFO L225 Difference]: With dead ends: 125 [2022-07-20 06:24:07,451 INFO L226 Difference]: Without dead ends: 125 [2022-07-20 06:24:07,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1039, Unknown=2, NotChecked=134, Total=1332 [2022-07-20 06:24:07,453 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 165 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:07,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 896 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:24:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-20 06:24:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2022-07-20 06:24:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:24:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2022-07-20 06:24:07,456 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 33 [2022-07-20 06:24:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:07,457 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2022-07-20 06:24:07,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-07-20 06:24:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:24:07,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:07,458 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:24:07,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:24:07,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:07,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:07,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2022-07-20 06:24:07,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:07,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806334175] [2022-07-20 06:24:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:07,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:07,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:24:08,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:08,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806334175] [2022-07-20 06:24:08,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806334175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:08,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707849891] [2022-07-20 06:24:08,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:08,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:08,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:08,098 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) [2022-07-20 06:24:08,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 06:24:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:08,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-20 06:24:08,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:08,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:08,492 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:24:08,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:08,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 11 [2022-07-20 06:24:08,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:08,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:08,697 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:24:08,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-07-20 06:24:08,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 33 [2022-07-20 06:24:08,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 19 [2022-07-20 06:24:08,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2022-07-20 06:24:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:24:08,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:09,202 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-07-20 06:24:09,217 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-07-20 06:24:09,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:09,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-20 06:24:09,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:09,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 06:24:09,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 44 [2022-07-20 06:24:09,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 70 [2022-07-20 06:24:09,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-07-20 06:24:09,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 58 [2022-07-20 06:24:09,276 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:09,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-20 06:24:09,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:09,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2022-07-20 06:24:13,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707849891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:13,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:24:13,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-07-20 06:24:13,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144207644] [2022-07-20 06:24:13,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:24:13,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 06:24:13,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:13,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 06:24:13,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1945, Unknown=2, NotChecked=178, Total=2256 [2022-07-20 06:24:13,496 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:24:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:14,694 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-07-20 06:24:14,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:24:14,695 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-07-20 06:24:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:14,695 INFO L225 Difference]: With dead ends: 150 [2022-07-20 06:24:14,696 INFO L226 Difference]: Without dead ends: 150 [2022-07-20 06:24:14,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=263, Invalid=2713, Unknown=2, NotChecked=214, Total=3192 [2022-07-20 06:24:14,697 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 235 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:14,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1402 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:24:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-20 06:24:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-07-20 06:24:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:24:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-07-20 06:24:14,700 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 33 [2022-07-20 06:24:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:14,701 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-07-20 06:24:14,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:24:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-07-20 06:24:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:24:14,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:14,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:24:14,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:24:14,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-20 06:24:14,902 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:14,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2022-07-20 06:24:14,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:14,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12804911] [2022-07-20 06:24:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:14,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:24:15,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:15,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12804911] [2022-07-20 06:24:15,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12804911] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:15,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985262763] [2022-07-20 06:24:15,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:24:15,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:15,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:15,005 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) [2022-07-20 06:24:15,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 06:24:15,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:24:15,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:24:15,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:24:15,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:24:15,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:24:15,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985262763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:15,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:24:15,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-07-20 06:24:15,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706218963] [2022-07-20 06:24:15,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:15,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:24:15,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:15,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:24:15,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:24:15,177 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:15,220 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-07-20 06:24:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:24:15,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-07-20 06:24:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:15,222 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:24:15,222 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:24:15,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:24:15,224 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 206 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:15,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 115 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:24:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:24:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-20 06:24:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:24:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-07-20 06:24:15,229 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 36 [2022-07-20 06:24:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:15,230 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-07-20 06:24:15,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-07-20 06:24:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:24:15,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:15,235 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:24:15,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:24:15,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:15,461 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2022-07-20 06:24:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:15,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432440024] [2022-07-20 06:24:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:15,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:15,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:15,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:24:15,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:15,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432440024] [2022-07-20 06:24:15,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432440024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:15,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:24:15,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:24:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439732609] [2022-07-20 06:24:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:15,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:24:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:24:15,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:24:15,579 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:15,786 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-07-20 06:24:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:24:15,787 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-07-20 06:24:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:15,787 INFO L225 Difference]: With dead ends: 114 [2022-07-20 06:24:15,787 INFO L226 Difference]: Without dead ends: 114 [2022-07-20 06:24:15,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:24:15,788 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 280 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:15,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:24:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-20 06:24:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2022-07-20 06:24:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:24:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-07-20 06:24:15,791 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 40 [2022-07-20 06:24:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:15,792 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-07-20 06:24:15,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-07-20 06:24:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:24:15,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:15,792 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:24:15,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:24:15,793 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash 999795887, now seen corresponding path program 1 times [2022-07-20 06:24:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:15,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627288049] [2022-07-20 06:24:15,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:15,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:15,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:24:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:15,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627288049] [2022-07-20 06:24:15,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627288049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:15,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949981641] [2022-07-20 06:24:15,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:15,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:15,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:15,906 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) [2022-07-20 06:24:15,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 06:24:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:16,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:24:16,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:24:16,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:24:16,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949981641] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:24:16,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:24:16,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-07-20 06:24:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572025831] [2022-07-20 06:24:16,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:24:16,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:24:16,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:16,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:24:16,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:24:16,117 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:24:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:16,188 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-07-20 06:24:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:24:16,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-07-20 06:24:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:16,189 INFO L225 Difference]: With dead ends: 120 [2022-07-20 06:24:16,189 INFO L226 Difference]: Without dead ends: 120 [2022-07-20 06:24:16,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:24:16,190 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 142 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:16,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 250 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:24:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-20 06:24:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2022-07-20 06:24:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:24:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2022-07-20 06:24:16,194 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 40 [2022-07-20 06:24:16,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:16,194 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2022-07-20 06:24:16,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:24:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2022-07-20 06:24:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:24:16,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:16,195 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:24:16,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:24:16,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:16,416 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2022-07-20 06:24:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:16,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827671115] [2022-07-20 06:24:16,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:16,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:24:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:16,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827671115] [2022-07-20 06:24:16,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827671115] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:16,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67215714] [2022-07-20 06:24:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:16,516 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) [2022-07-20 06:24:16,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 06:24:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:16,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:24:16,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:24:16,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:24:16,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67215714] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:24:16,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:24:16,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-07-20 06:24:16,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111614797] [2022-07-20 06:24:16,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:24:16,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:24:16,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:16,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:24:16,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:24:16,720 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:24:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:16,826 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-07-20 06:24:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:24:16,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-07-20 06:24:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:16,827 INFO L225 Difference]: With dead ends: 114 [2022-07-20 06:24:16,827 INFO L226 Difference]: Without dead ends: 114 [2022-07-20 06:24:16,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:24:16,828 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 195 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:16,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 265 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:24:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-20 06:24:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2022-07-20 06:24:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:24:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-07-20 06:24:16,831 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 41 [2022-07-20 06:24:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:16,831 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-07-20 06:24:16,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:24:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-07-20 06:24:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:24:16,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:16,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:24:16,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-20 06:24:17,043 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,SelfDestructingSolverStorable15 [2022-07-20 06:24:17,044 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -192932373, now seen corresponding path program 3 times [2022-07-20 06:24:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:17,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663371394] [2022-07-20 06:24:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:17,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:17,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 06:24:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 06:24:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:17,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663371394] [2022-07-20 06:24:17,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663371394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:17,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710051238] [2022-07-20 06:24:17,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 06:24:17,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:17,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:17,128 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) [2022-07-20 06:24:17,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 06:24:17,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-20 06:24:17,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:24:17,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:24:17,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:24:17,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:24:17,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710051238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:17,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:24:17,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-20 06:24:17,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614365180] [2022-07-20 06:24:17,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:17,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:24:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:17,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:24:17,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:24:17,304 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:24:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:17,313 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-07-20 06:24:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:24:17,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-07-20 06:24:17,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:17,315 INFO L225 Difference]: With dead ends: 92 [2022-07-20 06:24:17,315 INFO L226 Difference]: Without dead ends: 92 [2022-07-20 06:24:17,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:24:17,316 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:17,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:24:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-20 06:24:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-20 06:24:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2022-07-20 06:24:17,321 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 45 [2022-07-20 06:24:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:17,321 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2022-07-20 06:24:17,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:24:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-07-20 06:24:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:24:17,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:17,323 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:24:17,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:24:17,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-20 06:24:17,540 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:17,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:17,540 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 2 times [2022-07-20 06:24:17,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:17,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292426683] [2022-07-20 06:24:17,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:17,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:17,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:24:17,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:17,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292426683] [2022-07-20 06:24:17,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292426683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:17,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:24:17,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:24:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036175452] [2022-07-20 06:24:17,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:17,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:24:17,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:17,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:24:17,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:24:17,699 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:17,902 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-07-20 06:24:17,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:24:17,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-20 06:24:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:17,903 INFO L225 Difference]: With dead ends: 132 [2022-07-20 06:24:17,903 INFO L226 Difference]: Without dead ends: 132 [2022-07-20 06:24:17,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:24:17,904 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 409 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:17,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 294 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:24:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-20 06:24:17,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2022-07-20 06:24:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-07-20 06:24:17,907 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 45 [2022-07-20 06:24:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:17,908 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-07-20 06:24:17,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-07-20 06:24:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 06:24:17,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:17,908 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] [2022-07-20 06:24:17,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 06:24:17,909 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:17,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2022-07-20 06:24:17,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:17,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627072298] [2022-07-20 06:24:17,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:17,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:17,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-20 06:24:17,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:17,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627072298] [2022-07-20 06:24:17,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627072298] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:17,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103063199] [2022-07-20 06:24:17,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:17,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:17,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:17,992 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) [2022-07-20 06:24:18,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 06:24:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:18,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:24:18,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-20 06:24:18,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:24:18,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103063199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:24:18,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:24:18,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-07-20 06:24:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988823993] [2022-07-20 06:24:18,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:24:18,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:24:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:18,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:24:18,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:24:18,209 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:18,249 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-07-20 06:24:18,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:24:18,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-20 06:24:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:18,250 INFO L225 Difference]: With dead ends: 88 [2022-07-20 06:24:18,250 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:24:18,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:24:18,251 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 161 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:18,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 117 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:24:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:24:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-20 06:24:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-07-20 06:24:18,253 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 48 [2022-07-20 06:24:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:18,254 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-07-20 06:24:18,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-07-20 06:24:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 06:24:18,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:18,255 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:24:18,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:24:18,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:18,472 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:18,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2022-07-20 06:24:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:18,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245232458] [2022-07-20 06:24:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:18,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:24:18,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:18,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245232458] [2022-07-20 06:24:18,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245232458] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:18,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635858646] [2022-07-20 06:24:18,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:18,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:18,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:18,946 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:24:18,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 06:24:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:19,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-20 06:24:19,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:19,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:19,230 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:24:19,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:19,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:19,363 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:24:19,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-20 06:24:19,589 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:24:19,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-20 06:24:19,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:24:19,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-07-20 06:24:19,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-20 06:24:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:24:19,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:24,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-07-20 06:24:24,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-07-20 06:24:24,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)) is different from false [2022-07-20 06:24:24,472 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-07-20 06:24:24,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2022-07-20 06:24:24,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-20 06:24:24,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-07-20 06:24:24,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:24,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2022-07-20 06:24:24,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 136 treesize of output 112 [2022-07-20 06:24:24,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 108 treesize of output 98 [2022-07-20 06:24:24,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 94 [2022-07-20 06:24:24,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635858646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:24,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:24:24,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 39 [2022-07-20 06:24:24,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19552245] [2022-07-20 06:24:24,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:24:24,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 06:24:24,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:24:24,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 06:24:24,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1799, Unknown=54, NotChecked=450, Total=2450 [2022-07-20 06:24:24,586 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:24:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:25,721 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-07-20 06:24:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:24:25,721 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-07-20 06:24:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:25,722 INFO L225 Difference]: With dead ends: 145 [2022-07-20 06:24:25,722 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 06:24:25,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=384, Invalid=3241, Unknown=55, NotChecked=610, Total=4290 [2022-07-20 06:24:25,729 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 547 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:25,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1091 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:24:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 06:24:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2022-07-20 06:24:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:24:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-20 06:24:25,733 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 48 [2022-07-20 06:24:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:25,733 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-20 06:24:25,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:24:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-20 06:24:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 06:24:25,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:25,734 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:24:25,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-20 06:24:25,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:25,944 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:24:25,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2022-07-20 06:24:25,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:24:25,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043848285] [2022-07-20 06:24:25,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:25,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:24:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:24:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:26,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:24:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:24:26,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:24:26,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043848285] [2022-07-20 06:24:26,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043848285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:26,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664955933] [2022-07-20 06:24:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:26,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:24:26,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:24:26,631 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:24:26,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 06:24:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:26,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-20 06:24:26,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:26,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:27,172 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:24:27,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:27,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:24:27,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:27,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:24:27,394 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:24:27,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-07-20 06:24:27,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 33 [2022-07-20 06:24:27,715 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:24:27,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-07-20 06:24:27,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 33 [2022-07-20 06:24:27,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:24:27,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 32 [2022-07-20 06:24:27,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:24:27,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 31 [2022-07-20 06:24:27,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 19 [2022-07-20 06:24:27,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2022-07-20 06:24:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:24:27,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:30,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2022-07-20 06:24:30,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))))) is different from false [2022-07-20 06:24:30,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-07-20 06:24:30,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-07-20 06:24:30,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))))) is different from false [2022-07-20 06:24:30,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))))) is different from false [2022-07-20 06:24:30,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-20 06:24:30,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (or (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (store (select (store .cse2 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-20 06:24:30,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (store (select (store .cse2 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))))) is different from false [2022-07-20 06:24:30,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:30,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2022-07-20 06:24:30,672 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:30,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 60 [2022-07-20 06:24:30,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 414 treesize of output 392 [2022-07-20 06:24:30,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2178 treesize of output 2144 [2022-07-20 06:24:30,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:30,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1978 treesize of output 1914 [2022-07-20 06:24:30,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:30,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1834 treesize of output 1746 [2022-07-20 06:24:30,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:30,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1666 treesize of output 1634 [2022-07-20 06:24:30,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:30,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1560 treesize of output 1470 [2022-07-20 06:24:30,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:30,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1306 treesize of output 1242 [2022-07-20 06:24:30,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:30,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1168 treesize of output 1134 [2022-07-20 06:24:57,049 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:57,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-20 06:24:57,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:57,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-20 06:24:57,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:57,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 25 [2022-07-20 06:24:57,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:57,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:57,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 19 [2022-07-20 06:24:57,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:57,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-07-20 06:25:09,297 WARN L233 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 31 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:25:09,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664955933] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:09,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:25:09,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2022-07-20 06:25:09,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728438355] [2022-07-20 06:25:09,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:09,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-20 06:25:09,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-20 06:25:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2914, Unknown=9, NotChecked=1044, Total=4160 [2022-07-20 06:25:09,300 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:25:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:10,800 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-07-20 06:25:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:25:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2022-07-20 06:25:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:10,801 INFO L225 Difference]: With dead ends: 124 [2022-07-20 06:25:10,801 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 06:25:10,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=404, Invalid=4453, Unknown=9, NotChecked=1296, Total=6162 [2022-07-20 06:25:10,804 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 654 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:10,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 2115 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1215 Invalid, 0 Unknown, 94 Unchecked, 0.6s Time] [2022-07-20 06:25:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 06:25:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2022-07-20 06:25:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-07-20 06:25:10,809 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 48 [2022-07-20 06:25:10,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:10,809 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-07-20 06:25:10,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:25:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-07-20 06:25:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 06:25:10,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:10,810 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:25:10,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:11,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-20 06:25:11,011 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:11,011 INFO L85 PathProgramCache]: Analyzing trace with hash -74907051, now seen corresponding path program 1 times [2022-07-20 06:25:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:11,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172500486] [2022-07-20 06:25:11,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-20 06:25:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172500486] [2022-07-20 06:25:11,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172500486] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924895877] [2022-07-20 06:25:11,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:11,104 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:25:11,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 06:25:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:11,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:25:11,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-20 06:25:11,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:11,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924895877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:11,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:25:11,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-20 06:25:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821797374] [2022-07-20 06:25:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:11,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:25:11,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:11,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:25:11,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:25:11,327 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:11,360 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-07-20 06:25:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:25:11,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-20 06:25:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:11,362 INFO L225 Difference]: With dead ends: 86 [2022-07-20 06:25:11,362 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 06:25:11,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:25:11,363 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 70 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:11,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 191 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:25:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 06:25:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-07-20 06:25:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-07-20 06:25:11,365 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 49 [2022-07-20 06:25:11,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:11,366 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-07-20 06:25:11,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-07-20 06:25:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 06:25:11,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:11,367 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:25:11,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:11,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-20 06:25:11,581 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash 836425368, now seen corresponding path program 1 times [2022-07-20 06:25:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:11,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195156419] [2022-07-20 06:25:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:25:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:12,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195156419] [2022-07-20 06:25:12,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195156419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:12,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452867118] [2022-07-20 06:25:12,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:12,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:12,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:12,459 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:25:12,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 06:25:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:12,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-20 06:25:12,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:12,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:12,843 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:25:12,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:12,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:12,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:12,983 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:25:12,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-07-20 06:25:12,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 9 [2022-07-20 06:25:13,291 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:25:13,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 55 [2022-07-20 06:25:13,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 21 [2022-07-20 06:25:13,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2022-07-20 06:25:13,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:13,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 38 [2022-07-20 06:25:13,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 30 [2022-07-20 06:25:13,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:13,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 34 [2022-07-20 06:25:13,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 32 [2022-07-20 06:25:13,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 treesize of output 24 [2022-07-20 06:25:13,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 18 [2022-07-20 06:25:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:25:13,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:14,277 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_2182)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_2181)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_2182)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_2181)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2022-07-20 06:25:14,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1)))))) is different from false [2022-07-20 06:25:14,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:25:14,368 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-07-20 06:25:14,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 23 [2022-07-20 06:25:14,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:25:14,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-07-20 06:25:14,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 23 [2022-07-20 06:25:14,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((|#memory_int| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) is different from false [2022-07-20 06:25:14,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:25:14,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-07-20 06:25:14,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 23 [2022-07-20 06:25:14,531 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:25:14,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-07-20 06:25:14,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 23 [2022-07-20 06:25:14,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:25:14,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-07-20 06:25:14,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 23 [2022-07-20 06:25:14,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:25:14,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-07-20 06:25:14,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 23 [2022-07-20 06:25:14,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:25:14,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-07-20 06:25:14,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 23 [2022-07-20 06:25:14,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:25:14,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:14,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-07-20 06:25:14,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 23 [2022-07-20 06:25:14,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)) (<= .cse1 .cse0) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ 4 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))))))) is different from false [2022-07-20 06:25:14,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (<= .cse1 .cse0) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 4) (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-07-20 06:25:14,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))))) is different from false [2022-07-20 06:25:14,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2022-07-20 06:25:14,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2022-07-20 06:25:15,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse1 (select (store (select (store .cse2 .cse1 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (+ (select (store (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) (+ (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))))))) is different from false [2022-07-20 06:25:15,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store .cse0 .cse1 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse1)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (+ (select (store (select (store .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4) (+ (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-07-20 06:25:15,112 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:15,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 41 [2022-07-20 06:25:15,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 262 treesize of output 240 [2022-07-20 06:25:15,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:25:15,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 214 treesize of output 206 [2022-07-20 06:25:15,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:25:15,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 194 treesize of output 176 [2022-07-20 06:25:15,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:25:15,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 150 treesize of output 134 [2022-07-20 06:25:15,166 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:25:15,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 1 [2022-07-20 06:25:15,173 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:25:15,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 1 [2022-07-20 06:25:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-20 06:25:15,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452867118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:25:15,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:25:15,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 78 [2022-07-20 06:25:15,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197989541] [2022-07-20 06:25:15,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:15,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-07-20 06:25:15,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:15,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-07-20 06:25:15,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4364, Unknown=10, NotChecked=1410, Total=6006 [2022-07-20 06:25:15,556 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 78 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 69 states have internal predecessors, (126), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:25:17,907 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store .cse1 .cse2 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse2)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (+ (select (store (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4) (+ (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0))) is different from false [2022-07-20 06:25:18,455 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse2 (select (store (select (store .cse3 .cse2 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (+ (select (store (select (store .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) (+ (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) is different from false [2022-07-20 06:25:20,460 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:25:22,463 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0)) is different from false [2022-07-20 06:25:24,468 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1))))))) is different from false [2022-07-20 06:25:25,082 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (<= .cse2 .cse1) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 4) (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-07-20 06:25:25,679 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= 0 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)) (<= .cse2 .cse1) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ 4 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-07-20 06:25:25,686 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) 4) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (forall ((|#memory_int| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-07-20 06:25:25,694 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= (select (select |c_#memory_int| .cse1) 4) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1)))))))) is different from false [2022-07-20 06:25:25,699 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ (select (select |c_#memory_int| .cse2) 4) 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))))))))) is different from false [2022-07-20 06:25:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:26,868 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-07-20 06:25:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 06:25:26,869 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 69 states have internal predecessors, (126), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2022-07-20 06:25:26,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:26,869 INFO L225 Difference]: With dead ends: 86 [2022-07-20 06:25:26,869 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 06:25:26,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 20 IntricatePredicates, 1 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=424, Invalid=6608, Unknown=20, NotChecked=3660, Total=10712 [2022-07-20 06:25:26,872 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 136 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 741 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:26,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1798 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1215 Invalid, 0 Unknown, 741 Unchecked, 0.5s Time] [2022-07-20 06:25:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 06:25:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-07-20 06:25:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-07-20 06:25:26,875 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 52 [2022-07-20 06:25:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:26,875 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-07-20 06:25:26,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 69 states have internal predecessors, (126), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:25:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-07-20 06:25:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:25:26,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:26,876 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:26,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:27,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:27,077 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:27,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash -368684005, now seen corresponding path program 1 times [2022-07-20 06:25:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:27,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666046515] [2022-07-20 06:25:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:25:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:27,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666046515] [2022-07-20 06:25:27,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666046515] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:27,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896681785] [2022-07-20 06:25:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:27,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:27,464 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:25:27,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 06:25:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:27,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-20 06:25:27,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:27,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 13 [2022-07-20 06:25:28,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 06:25:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:25:28,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:28,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:28,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:28,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:25:28,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896681785] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:25:28,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:25:28,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 39 [2022-07-20 06:25:28,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955315804] [2022-07-20 06:25:28,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:28,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-20 06:25:28,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:28,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-20 06:25:28,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1368, Unknown=0, NotChecked=0, Total=1482 [2022-07-20 06:25:28,463 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 06:25:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:29,427 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2022-07-20 06:25:29,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:25:29,428 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-07-20 06:25:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:29,428 INFO L225 Difference]: With dead ends: 118 [2022-07-20 06:25:29,429 INFO L226 Difference]: Without dead ends: 118 [2022-07-20 06:25:29,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=376, Invalid=2380, Unknown=0, NotChecked=0, Total=2756 [2022-07-20 06:25:29,430 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1009 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:29,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 856 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:25:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-20 06:25:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2022-07-20 06:25:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-07-20 06:25:29,433 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 59 [2022-07-20 06:25:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:29,433 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-07-20 06:25:29,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 06:25:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-07-20 06:25:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 06:25:29,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:29,434 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:25:29,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:29,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:29,635 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2070538002, now seen corresponding path program 2 times [2022-07-20 06:25:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:29,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199449676] [2022-07-20 06:25:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:29,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:29,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-20 06:25:29,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:29,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199449676] [2022-07-20 06:25:29,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199449676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:29,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155763755] [2022-07-20 06:25:29,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:25:29,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:29,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:29,728 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:25:29,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 06:25:29,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:25:29,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:25:29,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:25:29,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 06:25:29,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 06:25:30,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155763755] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:25:30,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:25:30,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-07-20 06:25:30,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938728406] [2022-07-20 06:25:30,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:30,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:25:30,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:30,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:25:30,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:25:30,025 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:25:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:30,104 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-07-20 06:25:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:25:30,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2022-07-20 06:25:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:30,107 INFO L225 Difference]: With dead ends: 79 [2022-07-20 06:25:30,107 INFO L226 Difference]: Without dead ends: 79 [2022-07-20 06:25:30,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:25:30,108 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 143 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:30,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 228 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-20 06:25:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-20 06:25:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-07-20 06:25:30,110 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 62 [2022-07-20 06:25:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:30,111 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-07-20 06:25:30,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:25:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-07-20 06:25:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 06:25:30,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:30,112 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:25:30,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:30,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-20 06:25:30,327 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:30,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash 424234897, now seen corresponding path program 1 times [2022-07-20 06:25:30,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:30,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800688346] [2022-07-20 06:25:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-20 06:25:30,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:30,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800688346] [2022-07-20 06:25:30,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800688346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:30,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:30,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:25:30,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185395238] [2022-07-20 06:25:30,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:30,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:25:30,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:30,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:25:30,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:25:30,428 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:30,618 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-07-20 06:25:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:25:30,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-07-20 06:25:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:30,619 INFO L225 Difference]: With dead ends: 97 [2022-07-20 06:25:30,619 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 06:25:30,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:25:30,619 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 187 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:30,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 258 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 06:25:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2022-07-20 06:25:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 78 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-07-20 06:25:30,622 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 63 [2022-07-20 06:25:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:30,622 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-07-20 06:25:30,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-07-20 06:25:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 06:25:30,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:30,622 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:25:30,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 06:25:30,623 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:30,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash 424234898, now seen corresponding path program 1 times [2022-07-20 06:25:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:30,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853685236] [2022-07-20 06:25:30,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:30,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:25:30,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:30,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853685236] [2022-07-20 06:25:30,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853685236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:30,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:30,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:25:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649528184] [2022-07-20 06:25:30,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:30,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:25:30,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:30,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:25:30,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:25:30,771 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:30,972 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-07-20 06:25:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:25:30,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-07-20 06:25:30,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:30,973 INFO L225 Difference]: With dead ends: 80 [2022-07-20 06:25:30,973 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 06:25:30,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:25:30,974 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 191 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:30,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 201 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 06:25:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-20 06:25:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-07-20 06:25:30,976 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 63 [2022-07-20 06:25:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:30,977 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-07-20 06:25:30,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-07-20 06:25:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 06:25:30,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:30,977 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:25:30,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 06:25:30,977 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash 266413795, now seen corresponding path program 1 times [2022-07-20 06:25:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:30,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765580608] [2022-07-20 06:25:30,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:25:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:31,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765580608] [2022-07-20 06:25:31,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765580608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:31,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:31,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:25:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993697288] [2022-07-20 06:25:31,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:31,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:25:31,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:25:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:25:31,114 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:31,252 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-07-20 06:25:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:25:31,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2022-07-20 06:25:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:31,254 INFO L225 Difference]: With dead ends: 80 [2022-07-20 06:25:31,254 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 06:25:31,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:25:31,254 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 187 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:31,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 257 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 06:25:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-20 06:25:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.173913043478261) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-07-20 06:25:31,256 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 64 [2022-07-20 06:25:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:31,257 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-07-20 06:25:31,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-07-20 06:25:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-20 06:25:31,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:31,257 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-07-20 06:25:31,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 06:25:31,257 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:31,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:31,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854879, now seen corresponding path program 1 times [2022-07-20 06:25:31,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:31,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041309258] [2022-07-20 06:25:31,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:31,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 06:25:31,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:31,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041309258] [2022-07-20 06:25:31,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041309258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:31,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865288032] [2022-07-20 06:25:31,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:31,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:31,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:31,368 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:25:31,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 06:25:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:31,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-20 06:25:31,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:31,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-20 06:25:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 06:25:31,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:31,897 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-20 06:25:31,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 15 [2022-07-20 06:25:31,948 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 06:25:31,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:25:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 06:25:32,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865288032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:25:32,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:25:32,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2022-07-20 06:25:32,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740340991] [2022-07-20 06:25:32,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:32,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 06:25:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:32,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 06:25:32,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-07-20 06:25:32,006 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 06:25:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:32,475 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-07-20 06:25:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:25:32,475 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2022-07-20 06:25:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:32,476 INFO L225 Difference]: With dead ends: 88 [2022-07-20 06:25:32,476 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:25:32,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2022-07-20 06:25:32,477 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 331 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:32,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 610 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:25:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:25:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-07-20 06:25:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-07-20 06:25:32,480 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 66 [2022-07-20 06:25:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:32,481 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-07-20 06:25:32,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 06:25:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-07-20 06:25:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-20 06:25:32,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:32,482 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-07-20 06:25:32,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:32,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-20 06:25:32,692 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854878, now seen corresponding path program 1 times [2022-07-20 06:25:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:32,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495515238] [2022-07-20 06:25:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:33,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:25:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:33,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495515238] [2022-07-20 06:25:33,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495515238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:33,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962827265] [2022-07-20 06:25:33,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:33,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:33,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:33,348 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:25:33,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 06:25:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:33,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-20 06:25:33,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:33,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:33,696 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:25:33,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:33,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:33,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:33,849 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:25:33,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-07-20 06:25:33,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-20 06:25:33,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 06:25:34,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:25:34,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:34,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:25:34,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 15 [2022-07-20 06:25:34,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 14 [2022-07-20 06:25:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:25:34,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:34,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:34,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 36 [2022-07-20 06:25:34,915 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 06:25:34,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:25:36,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:36,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-20 06:25:36,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:36,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:25:36,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 42 [2022-07-20 06:25:36,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 196 treesize of output 180 [2022-07-20 06:25:36,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 176 treesize of output 164 [2022-07-20 06:25:36,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 164 treesize of output 158 [2022-07-20 06:25:36,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 98 [2022-07-20 06:25:36,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962827265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:36,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:25:36,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 51 [2022-07-20 06:25:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436805200] [2022-07-20 06:25:36,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:36,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-20 06:25:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:36,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-20 06:25:36,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=4826, Unknown=9, NotChecked=0, Total=5112 [2022-07-20 06:25:36,927 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:25:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:38,473 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-07-20 06:25:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 06:25:38,473 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-07-20 06:25:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:38,474 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:25:38,474 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:25:38,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=669, Invalid=7512, Unknown=9, NotChecked=0, Total=8190 [2022-07-20 06:25:38,479 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 575 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:38,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 887 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:25:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:25:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2022-07-20 06:25:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 78 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-07-20 06:25:38,482 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 66 [2022-07-20 06:25:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:38,482 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-07-20 06:25:38,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:25:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-07-20 06:25:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-20 06:25:38,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:38,483 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-07-20 06:25:38,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:38,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:38,691 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1372895080, now seen corresponding path program 1 times [2022-07-20 06:25:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:38,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246478] [2022-07-20 06:25:38,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:38,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:25:38,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:38,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246478] [2022-07-20 06:25:38,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:38,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:38,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:25:38,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023043197] [2022-07-20 06:25:38,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:38,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:25:38,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:25:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:25:38,814 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:38,965 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-07-20 06:25:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:25:38,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-20 06:25:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:38,966 INFO L225 Difference]: With dead ends: 81 [2022-07-20 06:25:38,966 INFO L226 Difference]: Without dead ends: 81 [2022-07-20 06:25:38,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:25:38,966 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 172 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:38,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 222 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-20 06:25:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-20 06:25:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.125) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-07-20 06:25:38,969 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 67 [2022-07-20 06:25:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:38,969 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-07-20 06:25:38,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-07-20 06:25:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-20 06:25:38,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:38,970 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-07-20 06:25:38,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 06:25:38,971 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash -795789539, now seen corresponding path program 1 times [2022-07-20 06:25:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:38,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878440654] [2022-07-20 06:25:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:39,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:25:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:39,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878440654] [2022-07-20 06:25:39,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878440654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:39,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163776997] [2022-07-20 06:25:39,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:39,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:39,452 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:25:39,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-20 06:25:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:39,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-20 06:25:39,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:39,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:39,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:25:39,807 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:25:39,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:39,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:39,948 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:25:39,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-20 06:25:40,091 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:25:40,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-20 06:25:40,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:40,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-07-20 06:25:40,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-20 06:25:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-20 06:25:40,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:40,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:25:40,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ 1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:25:40,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:25:40,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:25:40,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:25:40,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2022-07-20 06:25:40,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-20 06:25:40,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3182 (Array Int Int)) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3182))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3183)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:25:40,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3182 (Array Int Int)) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3182))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3183)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:25:40,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:40,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2022-07-20 06:25:40,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 292 treesize of output 274 [2022-07-20 06:25:40,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:25:40,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 248 treesize of output 240 [2022-07-20 06:25:40,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:25:40,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 230 treesize of output 214 [2022-07-20 06:25:40,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:25:40,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 210 treesize of output 192 [2022-07-20 06:25:41,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163776997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:41,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:25:41,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 37 [2022-07-20 06:25:41,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272458006] [2022-07-20 06:25:41,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:41,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 06:25:41,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:41,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 06:25:41,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1679, Unknown=9, NotChecked=810, Total=2652 [2022-07-20 06:25:41,157 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 33 states have internal predecessors, (99), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:41,959 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-07-20 06:25:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:25:41,959 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 33 states have internal predecessors, (99), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 69 [2022-07-20 06:25:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:41,960 INFO L225 Difference]: With dead ends: 86 [2022-07-20 06:25:41,960 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 06:25:41,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=319, Invalid=2788, Unknown=9, NotChecked=1044, Total=4160 [2022-07-20 06:25:41,961 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 152 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:41,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 679 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:25:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 06:25:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-07-20 06:25:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 78 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-07-20 06:25:41,963 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 69 [2022-07-20 06:25:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:41,964 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-07-20 06:25:41,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 33 states have internal predecessors, (99), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-07-20 06:25:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 06:25:41,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:41,965 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:41,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:42,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:42,171 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:42,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1056399479, now seen corresponding path program 1 times [2022-07-20 06:25:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:42,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740790181] [2022-07-20 06:25:42,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:42,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 06:25:42,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:42,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740790181] [2022-07-20 06:25:42,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740790181] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:42,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762946837] [2022-07-20 06:25:42,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:42,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:42,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:42,546 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:25:42,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-20 06:25:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:42,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-20 06:25:42,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:42,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:42,844 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:25:42,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:42,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:42,972 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:25:42,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:43,084 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:25:43,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:43,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-07-20 06:25:43,199 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:43,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2022-07-20 06:25:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:25:43,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:43,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0)))) is different from false [2022-07-20 06:25:43,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-07-20 06:25:43,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-07-20 06:25:43,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-07-20 06:25:43,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 4) v_ArrVal_3325) 0)))) is different from false [2022-07-20 06:25:43,514 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_3325) 0)))) is different from false [2022-07-20 06:25:43,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3323))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3324)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) is different from false [2022-07-20 06:25:43,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3323))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3324)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3325) 0)))) is different from false [2022-07-20 06:25:43,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:43,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2022-07-20 06:25:43,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 285 treesize of output 267 [2022-07-20 06:25:43,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:43,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 293 treesize of output 283 [2022-07-20 06:25:43,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 322 treesize of output 314 [2022-07-20 06:25:43,570 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:43,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 340 treesize of output 333 [2022-07-20 06:25:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2022-07-20 06:25:44,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762946837] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:25:44,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:25:44,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 58 [2022-07-20 06:25:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137485530] [2022-07-20 06:25:44,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:44,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-20 06:25:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-20 06:25:44,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2296, Unknown=8, NotChecked=824, Total=3306 [2022-07-20 06:25:44,077 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 06:25:44,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:44,840 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-07-20 06:25:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:25:44,840 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 70 [2022-07-20 06:25:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:44,840 INFO L225 Difference]: With dead ends: 80 [2022-07-20 06:25:44,840 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 06:25:44,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 109 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=291, Invalid=3273, Unknown=8, NotChecked=984, Total=4556 [2022-07-20 06:25:44,841 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 287 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 652 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:44,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 841 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 743 Invalid, 0 Unknown, 652 Unchecked, 0.3s Time] [2022-07-20 06:25:44,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 06:25:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-07-20 06:25:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-07-20 06:25:44,843 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 70 [2022-07-20 06:25:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:44,844 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-07-20 06:25:44,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 06:25:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-07-20 06:25:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-20 06:25:44,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:44,844 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:44,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:45,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-20 06:25:45,063 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:25:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 853476134, now seen corresponding path program 1 times [2022-07-20 06:25:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:45,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845580421] [2022-07-20 06:25:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:45,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:25:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:45,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:25:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:25:45,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:45,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845580421] [2022-07-20 06:25:45,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845580421] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:45,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612278819] [2022-07-20 06:25:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:45,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:45,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:45,772 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:25:45,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-20 06:25:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:45,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-20 06:25:46,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:46,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:46,084 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:25:46,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:46,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:46,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:25:46,202 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 06:25:46,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 33 [2022-07-20 06:25:46,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 22 [2022-07-20 06:25:46,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:46,518 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:25:46,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 57 [2022-07-20 06:25:46,528 INFO L356 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-07-20 06:25:46,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-07-20 06:25:46,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:46,647 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:25:46,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-07-20 06:25:46,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-20 06:25:46,995 INFO L356 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-07-20 06:25:46,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2022-07-20 06:25:47,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:25:47,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-20 06:25:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:25:47,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:49,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_3476)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3477) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select .cse1 .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))))) is different from false [2022-07-20 06:25:51,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (forall ((v_ArrVal_3477 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-20 06:25:53,561 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_3474)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= (select (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((v_ArrVal_3477 (Array Int Int))) (= (select (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse3 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse3 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-20 06:25:55,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (and (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) .cse1 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) .cse1 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (= (select (select (store .cse2 |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43|))))))) is different from false [2022-07-20 06:25:56,671 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474))))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store .cse3 |c_ULTIMATE.start_main_~s~0#1.base| .cse4) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-20 06:25:58,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (= (select (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2022-07-20 06:25:59,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474))))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (or (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse3) .cse4) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse4)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) is different from false [2022-07-20 06:26:00,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (= (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse2) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))))) is different from false [2022-07-20 06:26:02,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3471))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3477) (select (store (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse5) .cse6) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6))))))) is different from false [2022-07-20 06:26:04,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3471))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3477) (select (store (select (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse6) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-07-20 06:26:04,807 INFO L356 Elim1Store]: treesize reduction 144, result has 50.0 percent of original size [2022-07-20 06:26:04,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 640 treesize of output 669 [2022-07-20 06:26:04,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:05,171 INFO L356 Elim1Store]: treesize reduction 339, result has 36.4 percent of original size [2022-07-20 06:26:05,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 6024 treesize of output 2623 [2022-07-20 06:26:05,631 INFO L356 Elim1Store]: treesize reduction 164, result has 35.7 percent of original size [2022-07-20 06:26:05,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 554 treesize of output 573 [2022-07-20 06:26:05,676 INFO L356 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2022-07-20 06:26:05,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 684 treesize of output 694 [2022-07-20 06:26:05,776 INFO L356 Elim1Store]: treesize reduction 100, result has 35.9 percent of original size [2022-07-20 06:26:05,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 720 treesize of output 742 [2022-07-20 06:26:05,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:26:06,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:26:06,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 8 treesize of output 6 [2022-07-20 06:26:06,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 8 treesize of output 6 [2022-07-20 06:26:06,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:06,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 77 [2022-07-20 06:26:06,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 6 [2022-07-20 06:26:06,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:26:06,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:26:07,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:26:07,785 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-20 06:26:07,800 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:26:07,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 18 [2022-07-20 06:26:07,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 131 treesize of output 127 [2022-07-20 06:26:07,875 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:07,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 105 treesize of output 107 [2022-07-20 06:26:07,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:07,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 19 [2022-07-20 06:26:07,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:26:07,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:26:07,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:26:08,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:08,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 189 [2022-07-20 06:26:08,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 107 treesize of output 95 [2022-07-20 06:26:08,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 73 [2022-07-20 06:26:08,617 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 06:26:08,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 132 treesize of output 118 [2022-07-20 06:26:08,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:08,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:08,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:08,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 92 [2022-07-20 06:26:08,825 INFO L356 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2022-07-20 06:26:08,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 322 treesize of output 290 [2022-07-20 06:26:08,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:09,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:09,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 629 treesize of output 609 [2022-07-20 06:26:09,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:09,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:09,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 236 treesize of output 238 [2022-07-20 06:26:10,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612278819] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:10,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:26:10,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 47 [2022-07-20 06:26:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970335112] [2022-07-20 06:26:10,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:10,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-20 06:26:10,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:10,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-20 06:26:10,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3033, Unknown=10, NotChecked=1190, Total=4422 [2022-07-20 06:26:10,576 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 47 states, 47 states have (on average 2.297872340425532) internal successors, (108), 43 states have internal predecessors, (108), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:26:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:13,271 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-07-20 06:26:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:26:13,272 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.297872340425532) internal successors, (108), 43 states have internal predecessors, (108), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 72 [2022-07-20 06:26:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:13,272 INFO L225 Difference]: With dead ends: 71 [2022-07-20 06:26:13,272 INFO L226 Difference]: Without dead ends: 71 [2022-07-20 06:26:13,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=532, Invalid=4754, Unknown=10, NotChecked=1510, Total=6806 [2022-07-20 06:26:13,273 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 431 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:13,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 744 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:26:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-20 06:26:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-20 06:26:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:26:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-07-20 06:26:13,275 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 72 [2022-07-20 06:26:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:13,275 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-07-20 06:26:13,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.297872340425532) internal successors, (108), 43 states have internal predecessors, (108), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:26:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-07-20 06:26:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-20 06:26:13,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:13,276 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:13,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-07-20 06:26:13,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-20 06:26:13,477 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:26:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:13,477 INFO L85 PathProgramCache]: Analyzing trace with hash -148231466, now seen corresponding path program 1 times [2022-07-20 06:26:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:13,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601580865] [2022-07-20 06:26:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:13,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:13,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:26:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:13,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:26:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:26:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:14,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601580865] [2022-07-20 06:26:14,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601580865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:14,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060296888] [2022-07-20 06:26:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:14,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:26:14,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:26:14,065 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:26:14,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-20 06:26:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:14,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 06:26:14,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:14,450 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:26:14,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 06:26:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 06:26:14,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 06:26:14,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060296888] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:26:14,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:26:14,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7, 7] total 37 [2022-07-20 06:26:14,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654970318] [2022-07-20 06:26:14,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:14,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 06:26:14,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:14,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 06:26:14,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2022-07-20 06:26:14,705 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 38 states, 37 states have (on average 3.27027027027027) internal successors, (121), 35 states have internal predecessors, (121), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:26:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:15,757 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-07-20 06:26:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 06:26:15,757 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.27027027027027) internal successors, (121), 35 states have internal predecessors, (121), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2022-07-20 06:26:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:15,758 INFO L225 Difference]: With dead ends: 70 [2022-07-20 06:26:15,758 INFO L226 Difference]: Without dead ends: 70 [2022-07-20 06:26:15,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=359, Invalid=2721, Unknown=0, NotChecked=0, Total=3080 [2022-07-20 06:26:15,759 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 191 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:15,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 401 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 617 Invalid, 0 Unknown, 38 Unchecked, 0.3s Time] [2022-07-20 06:26:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-20 06:26:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-20 06:26:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:26:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2022-07-20 06:26:15,761 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 74 [2022-07-20 06:26:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:15,761 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2022-07-20 06:26:15,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.27027027027027) internal successors, (121), 35 states have internal predecessors, (121), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:26:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2022-07-20 06:26:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 06:26:15,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:15,762 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:15,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:15,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:26:15,975 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-20 06:26:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash -716512516, now seen corresponding path program 1 times [2022-07-20 06:26:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:15,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839512809] [2022-07-20 06:26:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:15,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:16,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:26:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:16,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:26:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 06:26:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:16,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839512809] [2022-07-20 06:26:16,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839512809] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:16,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222377052] [2022-07-20 06:26:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:16,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:26:16,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:26:16,800 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:26:16,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-20 06:26:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:17,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-20 06:26:17,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:17,200 INFO L356 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2022-07-20 06:26:17,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2022-07-20 06:26:17,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:26:17,417 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:26:17,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 53 [2022-07-20 06:26:17,786 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:26:17,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 53 [2022-07-20 06:26:17,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 42 [2022-07-20 06:26:18,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:18,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 39 [2022-07-20 06:26:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 06:26:18,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:29,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3755 Int) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)) (= (store (store |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3755) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-20 06:26:29,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3755 Int) (v_ArrVal_3754 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)) (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3754) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3755) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-20 06:26:29,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3755 Int) (v_ArrVal_3754 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3754) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3755) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:26:29,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3755 Int) (v_ArrVal_3754 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)) (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3754) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3755) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-20 06:26:29,799 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3755 Int) (v_ArrVal_3754 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3754) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3755) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:26:29,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3755 Int) (v_ArrVal_3754 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3754) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 4) v_ArrVal_3755) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:26:29,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3755 Int) (v_ArrVal_3754 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3754) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_3755) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:26:29,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3755 Int) (v_ArrVal_3753 (Array Int Int)) (v_ArrVal_3754 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (= (store (store |c_#valid| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3754)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_3755) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:26:29,854 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3755 Int) (v_ArrVal_3753 (Array Int Int)) (v_ArrVal_3754 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3754)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3755) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)))) is different from false [2022-07-20 06:26:29,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:29,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2022-07-20 06:26:29,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 356 treesize of output 338 [2022-07-20 06:26:29,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:29,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 312 treesize of output 304 [2022-07-20 06:26:29,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:29,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:29,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 294 treesize of output 286 [2022-07-20 06:26:29,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:29,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:29,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 274 treesize of output 264 [2022-07-20 06:27:36,890 WARN L233 SmtUtils]: Spent 1.10m on a formula simplification. DAG size of input: 63 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:28:01,439 WARN L233 SmtUtils]: Spent 24.08s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)