./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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/dll2c_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 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:30:14,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:30:14,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:30:14,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:30:14,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:30:14,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:30:14,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:30:14,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:30:14,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:30:14,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:30:14,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:30:14,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:30:14,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:30:14,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:30:14,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:30:14,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:30:14,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:30:14,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:30:14,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:30:14,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:30:14,653 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:30:14,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:30:14,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:30:14,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:30:14,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:30:14,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:30:14,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:30:14,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:30:14,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:30:14,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:30:14,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:30:14,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:30:14,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:30:14,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:30:14,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:30:14,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:30:14,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:30:14,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:30:14,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:30:14,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:30:14,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:30:14,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:30:14,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:30:14,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:30:14,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:30:14,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:30:14,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:30:14,711 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:30:14,711 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:30:14,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:30:14,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:30:14,712 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:30:14,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:30:14,714 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:30:14,714 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:30:14,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:30:14,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:30:14,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:30:14,715 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:30:14,715 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:30:14,715 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:30:14,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:30:14,716 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:30:14,716 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:30:14,716 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:30:14,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:30:14,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:30:14,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:30:14,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:30:14,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:30:14,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:30:14,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:30:14,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:30:14,719 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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-07-23 06:30:14,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:30:14,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:30:14,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:30:14,997 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:30:14,999 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:30:15,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-07-23 06:30:15,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1e30e5e/82abecd3e6cf4d9380bf9a35fd014af7/FLAGd0179863e [2022-07-23 06:30:15,506 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:30:15,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-07-23 06:30:15,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1e30e5e/82abecd3e6cf4d9380bf9a35fd014af7/FLAGd0179863e [2022-07-23 06:30:15,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1e30e5e/82abecd3e6cf4d9380bf9a35fd014af7 [2022-07-23 06:30:15,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:30:15,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:30:15,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:30:15,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:30:15,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:30:15,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:30:15" (1/1) ... [2022-07-23 06:30:15,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab75be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:15, skipping insertion in model container [2022-07-23 06:30:15,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:30:15" (1/1) ... [2022-07-23 06:30:15,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:30:15,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:30:16,214 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/dll2c_update_all_reverse.i[24556,24569] [2022-07-23 06:30:16,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:30:16,228 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:30:16,271 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/dll2c_update_all_reverse.i[24556,24569] [2022-07-23 06:30:16,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:30:16,294 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:30:16,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16 WrapperNode [2022-07-23 06:30:16,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:30:16,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:30:16,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:30:16,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:30:16,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (1/1) ... [2022-07-23 06:30:16,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (1/1) ... [2022-07-23 06:30:16,344 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2022-07-23 06:30:16,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:30:16,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:30:16,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:30:16,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:30:16,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (1/1) ... [2022-07-23 06:30:16,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (1/1) ... [2022-07-23 06:30:16,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (1/1) ... [2022-07-23 06:30:16,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (1/1) ... [2022-07-23 06:30:16,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (1/1) ... [2022-07-23 06:30:16,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (1/1) ... [2022-07-23 06:30:16,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (1/1) ... [2022-07-23 06:30:16,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:30:16,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:30:16,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:30:16,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:30:16,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (1/1) ... [2022-07-23 06:30:16,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:30:16,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:16,409 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-23 06:30:16,418 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-23 06:30:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:30:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:30:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-23 06:30:16,447 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-23 06:30:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:30:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:30:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:30:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:30:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:30:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:30:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:30:16,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:30:16,549 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:30:16,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:30:16,849 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:30:16,855 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:30:16,856 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-23 06:30:16,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:30:16 BoogieIcfgContainer [2022-07-23 06:30:16,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:30:16,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:30:16,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:30:16,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:30:16,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:30:15" (1/3) ... [2022-07-23 06:30:16,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b095d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:30:16, skipping insertion in model container [2022-07-23 06:30:16,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:16" (2/3) ... [2022-07-23 06:30:16,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b095d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:30:16, skipping insertion in model container [2022-07-23 06:30:16,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:30:16" (3/3) ... [2022-07-23 06:30:16,865 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-07-23 06:30:16,892 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:30:16,893 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-07-23 06:30:16,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:30:16,960 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@64196292, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c4a4f0f [2022-07-23 06:30:16,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-07-23 06:30:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 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-23 06:30:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:30:16,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:16,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:30:16,981 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:16,990 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2022-07-23 06:30:16,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:16,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155628398] [2022-07-23 06:30:16,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:17,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:17,177 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-23 06:30:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:17,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155628398] [2022-07-23 06:30:17,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155628398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:17,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:17,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:30:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324193444] [2022-07-23 06:30:17,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:17,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:30:17,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:30:17,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:17,219 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 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) 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-23 06:30:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:17,312 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-07-23 06:30:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:30:17,316 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-23 06:30:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:17,321 INFO L225 Difference]: With dead ends: 90 [2022-07-23 06:30:17,321 INFO L226 Difference]: Without dead ends: 87 [2022-07-23 06:30:17,322 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-23 06:30:17,325 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:17,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 147 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-23 06:30:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-23 06:30:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) 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-23 06:30:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-23 06:30:17,355 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2022-07-23 06:30:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:17,356 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-23 06:30:17,356 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-23 06:30:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-23 06:30:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:30:17,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:17,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:30:17,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:30:17,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:17,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2022-07-23 06:30:17,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:17,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105421726] [2022-07-23 06:30:17,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:17,424 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-23 06:30:17,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:17,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105421726] [2022-07-23 06:30:17,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105421726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:17,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:17,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:30:17,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433755480] [2022-07-23 06:30:17,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:17,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:30:17,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:17,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:30:17,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:17,429 INFO L87 Difference]: Start difference. First operand 87 states and 95 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-23 06:30:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:17,502 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-07-23 06:30:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:30:17,503 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-23 06:30:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:17,505 INFO L225 Difference]: With dead ends: 84 [2022-07-23 06:30:17,505 INFO L226 Difference]: Without dead ends: 84 [2022-07-23 06:30:17,510 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-23 06:30:17,511 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:17,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:30:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-23 06:30:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-23 06:30:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 80 states have internal predecessors, (88), 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-23 06:30:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-07-23 06:30:17,529 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2022-07-23 06:30:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:17,530 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-07-23 06:30:17,531 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-23 06:30:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-07-23 06:30:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:30:17,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:17,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:17,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:30:17,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2022-07-23 06:30:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:17,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847435711] [2022-07-23 06:30:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:17,636 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-23 06:30:17,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:17,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847435711] [2022-07-23 06:30:17,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847435711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:17,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:17,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:30:17,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599356821] [2022-07-23 06:30:17,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:17,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:30:17,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:17,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:30:17,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:30:17,639 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-23 06:30:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:17,713 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2022-07-23 06:30:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:30:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-07-23 06:30:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:17,718 INFO L225 Difference]: With dead ends: 95 [2022-07-23 06:30:17,718 INFO L226 Difference]: Without dead ends: 95 [2022-07-23 06:30:17,721 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-23 06:30:17,724 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:17,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-23 06:30:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-07-23 06:30:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 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-23 06:30:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2022-07-23 06:30:17,732 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2022-07-23 06:30:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:17,733 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2022-07-23 06:30:17,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-23 06:30:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-07-23 06:30:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:30:17,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:17,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:17,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:30:17,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2022-07-23 06:30:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:17,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430673934] [2022-07-23 06:30:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:17,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:17,860 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-23 06:30:17,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:17,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430673934] [2022-07-23 06:30:17,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430673934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:17,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:17,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:30:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39530115] [2022-07-23 06:30:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:17,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:30:17,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:17,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:30:17,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:30:17,863 INFO L87 Difference]: Start difference. First operand 85 states and 93 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-23 06:30:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:18,023 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-07-23 06:30:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:18,024 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 24 [2022-07-23 06:30:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:18,026 INFO L225 Difference]: With dead ends: 105 [2022-07-23 06:30:18,027 INFO L226 Difference]: Without dead ends: 105 [2022-07-23 06:30:18,027 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-23 06:30:18,033 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 77 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:18,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 286 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-23 06:30:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2022-07-23 06:30:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 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-23 06:30:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-07-23 06:30:18,046 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2022-07-23 06:30:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:18,047 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-07-23 06:30:18,047 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-23 06:30:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-07-23 06:30:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:30:18,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:18,048 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:18,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:30:18,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:18,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2022-07-23 06:30:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:18,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780188816] [2022-07-23 06:30:18,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:18,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:18,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:18,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:18,305 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-23 06:30:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:18,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780188816] [2022-07-23 06:30:18,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780188816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:18,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:18,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:30:18,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526205492] [2022-07-23 06:30:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:18,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:30:18,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:18,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:30:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:30:18,308 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-23 06:30:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:18,454 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-07-23 06:30:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:18,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2022-07-23 06:30:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:18,456 INFO L225 Difference]: With dead ends: 84 [2022-07-23 06:30:18,456 INFO L226 Difference]: Without dead ends: 84 [2022-07-23 06:30:18,457 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-23 06:30:18,457 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:18,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 295 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:18,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-23 06:30:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-07-23 06:30:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 79 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-23 06:30:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-07-23 06:30:18,462 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2022-07-23 06:30:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:18,463 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-07-23 06:30:18,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-23 06:30:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-07-23 06:30:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:30:18,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:18,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:18,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:30:18,464 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2022-07-23 06:30:18,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:18,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523794661] [2022-07-23 06:30:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:18,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:30:18,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:18,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523794661] [2022-07-23 06:30:18,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523794661] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:18,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391839548] [2022-07-23 06:30:18,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:18,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:18,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:18,607 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-23 06:30:18,615 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-23 06:30:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:18,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 06:30:18,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:18,772 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-23 06:30:18,996 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:30:18,997 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-23 06:30:19,011 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-23 06:30:19,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:19,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391839548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:19,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:19,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-23 06:30:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416421425] [2022-07-23 06:30:19,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:19,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:30:19,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:19,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:30:19,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:30:19,062 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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-23 06:30:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:19,260 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-07-23 06:30:19,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:19,260 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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 26 [2022-07-23 06:30:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:19,262 INFO L225 Difference]: With dead ends: 110 [2022-07-23 06:30:19,262 INFO L226 Difference]: Without dead ends: 110 [2022-07-23 06:30:19,263 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-23 06:30:19,264 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:19,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 420 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-07-23 06:30:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-23 06:30:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2022-07-23 06:30:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 83 states have internal predecessors, (93), 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-23 06:30:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-07-23 06:30:19,276 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2022-07-23 06:30:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:19,276 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-07-23 06:30:19,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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-23 06:30:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-07-23 06:30:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:30:19,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:19,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:19,306 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-23 06:30:19,491 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-23 06:30:19,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2022-07-23 06:30:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:19,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069372375] [2022-07-23 06:30:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:19,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:19,754 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-23 06:30:19,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:19,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069372375] [2022-07-23 06:30:19,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069372375] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:19,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902322999] [2022-07-23 06:30:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:19,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:19,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:19,757 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-23 06:30:19,758 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-23 06:30:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:19,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 06:30:19,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:19,869 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-23 06:30:20,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:20,126 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-23 06:30:20,134 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:30:20,134 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-23 06:30:20,165 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-23 06:30:20,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:20,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902322999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:20,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:20,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-07-23 06:30:20,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399102258] [2022-07-23 06:30:20,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:20,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:30:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:30:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:30:20,292 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 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-23 06:30:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:20,611 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-07-23 06:30:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:30:20,612 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 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 26 [2022-07-23 06:30:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:20,612 INFO L225 Difference]: With dead ends: 90 [2022-07-23 06:30:20,612 INFO L226 Difference]: Without dead ends: 90 [2022-07-23 06:30:20,613 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-23 06:30:20,613 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:20,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 690 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 465 Invalid, 0 Unknown, 2 Unchecked, 0.3s Time] [2022-07-23 06:30:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-23 06:30:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-07-23 06:30:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 83 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-23 06:30:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2022-07-23 06:30:20,617 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2022-07-23 06:30:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:20,618 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2022-07-23 06:30:20,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 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-23 06:30:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-07-23 06:30:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:30:20,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:20,619 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:20,644 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-23 06:30:20,820 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-23 06:30:20,820 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:20,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2022-07-23 06:30:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:20,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591203051] [2022-07-23 06:30:20,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:20,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:20,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:20,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:30:20,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:20,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591203051] [2022-07-23 06:30:20,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591203051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:20,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447006965] [2022-07-23 06:30:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:20,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:20,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:20,934 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-23 06:30:20,936 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-23 06:30:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:21,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:30:21,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:30:21,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:30:21,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447006965] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:21,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:30:21,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-07-23 06:30:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396974607] [2022-07-23 06:30:21,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:21,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:30:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:21,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:30:21,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:30:21,188 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 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-23 06:30:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:21,287 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-07-23 06:30:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:21,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 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 28 [2022-07-23 06:30:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:21,288 INFO L225 Difference]: With dead ends: 89 [2022-07-23 06:30:21,288 INFO L226 Difference]: Without dead ends: 89 [2022-07-23 06:30:21,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:30:21,289 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:21,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 433 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-23 06:30:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-07-23 06:30:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 83 states have internal predecessors, (91), 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-23 06:30:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-07-23 06:30:21,294 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2022-07-23 06:30:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:21,294 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-07-23 06:30:21,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 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-23 06:30:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-07-23 06:30:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:30:21,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:21,296 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:21,324 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-23 06:30:21,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:21,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2022-07-23 06:30:21,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:21,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053491999] [2022-07-23 06:30:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:21,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:21,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-23 06:30:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053491999] [2022-07-23 06:30:21,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053491999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:21,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910526360] [2022-07-23 06:30:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:21,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:21,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:21,608 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-23 06:30:21,610 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-23 06:30:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:21,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:30:21,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-23 06:30:21,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:21,762 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:30:21,763 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 12 treesize of output 11 [2022-07-23 06:30:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-23 06:30:21,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910526360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:21,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:30:21,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-07-23 06:30:21,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129244902] [2022-07-23 06:30:21,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:21,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:21,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:21,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:21,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:21,785 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-23 06:30:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:21,893 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2022-07-23 06:30:21,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:21,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-07-23 06:30:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:21,895 INFO L225 Difference]: With dead ends: 113 [2022-07-23 06:30:21,895 INFO L226 Difference]: Without dead ends: 113 [2022-07-23 06:30:21,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:30:21,898 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 125 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:21,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 209 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-23 06:30:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2022-07-23 06:30:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 86 states have internal predecessors, (96), 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-23 06:30:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-07-23 06:30:21,909 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2022-07-23 06:30:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:21,909 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-07-23 06:30:21,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-23 06:30:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-07-23 06:30:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:30:21,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:21,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:21,938 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-23 06:30:22,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:22,136 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:22,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:22,137 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2022-07-23 06:30:22,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:22,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697455672] [2022-07-23 06:30:22,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:22,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:22,299 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-23 06:30:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:22,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697455672] [2022-07-23 06:30:22,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697455672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:22,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164881187] [2022-07-23 06:30:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:22,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:22,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:22,304 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-23 06:30:22,327 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-23 06:30:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:22,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-23 06:30:22,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:22,529 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-23 06:30:22,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:22,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:22,562 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 20 treesize of output 24 [2022-07-23 06:30:22,647 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-23 06:30:22,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164881187] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:22,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:30:22,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-07-23 06:30:22,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809362171] [2022-07-23 06:30:22,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:22,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 06:30:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:22,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 06:30:22,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:30:22,650 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:30:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:22,888 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2022-07-23 06:30:22,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:30:22,889 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-07-23 06:30:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:22,890 INFO L225 Difference]: With dead ends: 150 [2022-07-23 06:30:22,890 INFO L226 Difference]: Without dead ends: 150 [2022-07-23 06:30:22,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-07-23 06:30:22,891 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:22,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 748 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:30:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-23 06:30:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-07-23 06:30:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) 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-23 06:30:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-07-23 06:30:22,894 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2022-07-23 06:30:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:22,895 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-07-23 06:30:22,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:30:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-07-23 06:30:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:30:22,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:22,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:22,924 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-23 06:30:23,096 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,SelfDestructingSolverStorable9 [2022-07-23 06:30:23,097 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2022-07-23 06:30:23,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:23,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759981545] [2022-07-23 06:30:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 06:30:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:23,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759981545] [2022-07-23 06:30:23,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759981545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:23,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:23,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:30:23,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382733837] [2022-07-23 06:30:23,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:23,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:30:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:23,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:30:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:30:23,197 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-23 06:30:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:23,342 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-07-23 06:30:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:30:23,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-23 06:30:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:23,344 INFO L225 Difference]: With dead ends: 111 [2022-07-23 06:30:23,344 INFO L226 Difference]: Without dead ends: 111 [2022-07-23 06:30:23,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:30:23,345 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 135 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:23,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 294 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-23 06:30:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-07-23 06:30:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.540983606557377) internal successors, (94), 85 states have internal predecessors, (94), 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-23 06:30:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-07-23 06:30:23,348 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 30 [2022-07-23 06:30:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:23,349 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-07-23 06:30:23,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-23 06:30:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-07-23 06:30:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:30:23,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:23,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:23,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:30:23,350 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2022-07-23 06:30:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:23,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977069170] [2022-07-23 06:30:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:30:23,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:23,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977069170] [2022-07-23 06:30:23,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977069170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:23,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:23,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:30:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241708130] [2022-07-23 06:30:23,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:23,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:30:23,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:23,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:30:23,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:30:23,462 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-23 06:30:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:23,605 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-07-23 06:30:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:30:23,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-23 06:30:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:23,607 INFO L225 Difference]: With dead ends: 89 [2022-07-23 06:30:23,607 INFO L226 Difference]: Without dead ends: 89 [2022-07-23 06:30:23,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:30:23,608 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 136 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:23,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 290 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-23 06:30:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-23 06:30:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 84 states have internal predecessors, (93), 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-23 06:30:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2022-07-23 06:30:23,611 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2022-07-23 06:30:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:23,612 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2022-07-23 06:30:23,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-23 06:30:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2022-07-23 06:30:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 06:30:23,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:23,613 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 06:30:23,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 06:30:23,613 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:23,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:23,613 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2022-07-23 06:30:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:23,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319989054] [2022-07-23 06:30:23,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:23,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 06:30:23,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:23,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319989054] [2022-07-23 06:30:23,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319989054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:23,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:23,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:30:23,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823477122] [2022-07-23 06:30:23,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:23,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:30:23,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:23,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:30:23,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:30:23,729 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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-23 06:30:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:24,013 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2022-07-23 06:30:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:30:24,014 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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 35 [2022-07-23 06:30:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:24,015 INFO L225 Difference]: With dead ends: 158 [2022-07-23 06:30:24,015 INFO L226 Difference]: Without dead ends: 158 [2022-07-23 06:30:24,015 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-23 06:30:24,015 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 320 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:24,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 509 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:30:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-23 06:30:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 92. [2022-07-23 06:30:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 87 states have internal predecessors, (99), 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-23 06:30:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-07-23 06:30:24,019 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2022-07-23 06:30:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:24,019 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-07-23 06:30:24,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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-23 06:30:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-07-23 06:30:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 06:30:24,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:24,020 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 06:30:24,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 06:30:24,020 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:24,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:24,020 INFO L85 PathProgramCache]: Analyzing trace with hash 452746568, now seen corresponding path program 1 times [2022-07-23 06:30:24,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:24,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316981497] [2022-07-23 06:30:24,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:24,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:24,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:30:24,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:24,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316981497] [2022-07-23 06:30:24,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316981497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:24,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:24,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:30:24,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736853261] [2022-07-23 06:30:24,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:24,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:24,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:24,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:24,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:24,120 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-23 06:30:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:24,212 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-07-23 06:30:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:24,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 35 [2022-07-23 06:30:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:24,213 INFO L225 Difference]: With dead ends: 120 [2022-07-23 06:30:24,213 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 06:30:24,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:30:24,214 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 122 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:24,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 270 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:24,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 06:30:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2022-07-23 06:30:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 90 states have internal predecessors, (102), 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-23 06:30:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-07-23 06:30:24,218 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 35 [2022-07-23 06:30:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:24,218 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-07-23 06:30:24,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-23 06:30:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-07-23 06:30:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 06:30:24,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:24,219 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 06:30:24,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 06:30:24,220 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash 452746623, now seen corresponding path program 1 times [2022-07-23 06:30:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:24,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005223664] [2022-07-23 06:30:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:24,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:24,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:30:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:24,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005223664] [2022-07-23 06:30:24,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005223664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:24,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:24,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:30:24,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110419142] [2022-07-23 06:30:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:24,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:30:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:24,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:30:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:30:24,406 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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-23 06:30:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:24,688 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-07-23 06:30:24,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:30:24,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 35 [2022-07-23 06:30:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:24,690 INFO L225 Difference]: With dead ends: 142 [2022-07-23 06:30:24,690 INFO L226 Difference]: Without dead ends: 142 [2022-07-23 06:30:24,690 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-23 06:30:24,691 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 315 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:24,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 530 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:30:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-23 06:30:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 95. [2022-07-23 06:30:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.492537313432836) internal successors, (100), 90 states have internal predecessors, (100), 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-23 06:30:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2022-07-23 06:30:24,694 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 35 [2022-07-23 06:30:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:24,694 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2022-07-23 06:30:24,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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-23 06:30:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2022-07-23 06:30:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:30:24,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:24,695 INFO L195 NwaCegarLoop]: trace histogram [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-23 06:30:24,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 06:30:24,695 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2022-07-23 06:30:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:24,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752339866] [2022-07-23 06:30:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:30:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752339866] [2022-07-23 06:30:25,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752339866] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:25,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674628825] [2022-07-23 06:30:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:25,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:25,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:25,076 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-23 06:30:25,077 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-23 06:30:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:25,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-23 06:30:25,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:25,245 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-23 06:30:25,334 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:30:25,334 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-23 06:30:25,386 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-23 06:30:25,428 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:30:25,428 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 26 treesize of output 27 [2022-07-23 06:30:25,475 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:30:25,475 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-23 06:30:25,510 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-23 06:30:25,511 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2022-07-23 06:30:25,613 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-23 06:30:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:30:25,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:25,650 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-23 06:30:25,650 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-23 06:30:25,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2022-07-23 06:30:25,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2022-07-23 06:30:25,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1578 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2022-07-23 06:30:25,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:25,687 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 21 treesize of output 22 [2022-07-23 06:30:25,690 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 60 treesize of output 52 [2022-07-23 06:30:25,694 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 24 treesize of output 22 [2022-07-23 06:30:25,696 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 46 treesize of output 42 [2022-07-23 06:30:25,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674628825] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:25,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:25,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 31 [2022-07-23 06:30:25,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242140377] [2022-07-23 06:30:25,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:25,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-23 06:30:25,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:25,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-23 06:30:25,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=980, Unknown=3, NotChecked=192, Total=1260 [2022-07-23 06:30:25,793 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 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-23 06:30:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:26,722 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2022-07-23 06:30:26,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 06:30:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 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 38 [2022-07-23 06:30:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:26,724 INFO L225 Difference]: With dead ends: 136 [2022-07-23 06:30:26,724 INFO L226 Difference]: Without dead ends: 136 [2022-07-23 06:30:26,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1610, Unknown=3, NotChecked=252, Total=2070 [2022-07-23 06:30:26,725 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 211 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:26,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1222 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 06:30:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-23 06:30:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2022-07-23 06:30:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 100 states have internal predecessors, (113), 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-23 06:30:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-07-23 06:30:26,729 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 38 [2022-07-23 06:30:26,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:26,729 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-07-23 06:30:26,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 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-23 06:30:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-07-23 06:30:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:30:26,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:26,730 INFO L195 NwaCegarLoop]: trace histogram [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-23 06:30:26,757 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-23 06:30:26,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-23 06:30:26,947 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:26,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337164, now seen corresponding path program 1 times [2022-07-23 06:30:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:26,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316737038] [2022-07-23 06:30:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:27,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:30:27,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:27,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316737038] [2022-07-23 06:30:27,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316737038] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:27,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106835057] [2022-07-23 06:30:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:27,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:27,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:27,456 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-23 06:30:27,462 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-23 06:30:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:27,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-23 06:30:27,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:27,624 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-23 06:30:27,627 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-23 06:30:27,924 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:30:27,925 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-23 06:30:27,945 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:30:27,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 11 treesize of output 11 [2022-07-23 06:30:28,032 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-23 06:30:28,040 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-23 06:30:28,130 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:30:28,130 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 45 treesize of output 42 [2022-07-23 06:30:28,135 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-23 06:30:28,261 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:30:28,261 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 38 treesize of output 37 [2022-07-23 06:30:28,264 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-23 06:30:28,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:28,313 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-23 06:30:28,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:28,321 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-23 06:30:28,456 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-23 06:30:28,459 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 15 treesize of output 7 [2022-07-23 06:30:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:30:28,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:29,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:29,075 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 44 [2022-07-23 06:30:29,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:29,083 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 35 treesize of output 36 [2022-07-23 06:30:29,087 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 116 treesize of output 108 [2022-07-23 06:30:29,091 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 334 treesize of output 314 [2022-07-23 06:30:29,099 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 158 treesize of output 150 [2022-07-23 06:30:29,104 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 302 treesize of output 286 [2022-07-23 06:30:29,112 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 286 treesize of output 270 [2022-07-23 06:30:29,116 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 270 treesize of output 262 [2022-07-23 06:30:29,283 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:29,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 06:30:29,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:30:29,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:30:29,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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-23 06:30:37,580 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 35 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:30:37,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106835057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:37,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:37,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2022-07-23 06:30:37,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528381840] [2022-07-23 06:30:37,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:37,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-23 06:30:37,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:37,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-23 06:30:37,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2508, Unknown=2, NotChecked=0, Total=2652 [2022-07-23 06:30:37,584 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 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-23 06:30:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:39,588 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2022-07-23 06:30:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 06:30:39,589 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 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 38 [2022-07-23 06:30:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:39,590 INFO L225 Difference]: With dead ends: 216 [2022-07-23 06:30:39,590 INFO L226 Difference]: Without dead ends: 216 [2022-07-23 06:30:39,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=351, Invalid=3937, Unknown=2, NotChecked=0, Total=4290 [2022-07-23 06:30:39,592 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1178 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:39,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 2417 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1672 Invalid, 0 Unknown, 107 Unchecked, 0.8s Time] [2022-07-23 06:30:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-23 06:30:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 113. [2022-07-23 06:30:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 108 states have internal predecessors, (124), 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-23 06:30:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2022-07-23 06:30:39,596 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 38 [2022-07-23 06:30:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:39,596 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2022-07-23 06:30:39,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 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-23 06:30:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2022-07-23 06:30:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:30:39,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:39,597 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:39,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-23 06:30:39,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:39,816 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2022-07-23 06:30:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:39,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849920416] [2022-07-23 06:30:39,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:39,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 06:30:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 06:30:39,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:39,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849920416] [2022-07-23 06:30:39,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849920416] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:39,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197709963] [2022-07-23 06:30:39,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:39,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:39,895 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-23 06:30:39,901 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-23 06:30:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:30:40,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-23 06:30:40,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:40,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197709963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:40,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:30:40,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-23 06:30:40,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439875962] [2022-07-23 06:30:40,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:40,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:30:40,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:40,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:30:40,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:40,110 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-23 06:30:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:40,119 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-07-23 06:30:40,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:30:40,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 41 [2022-07-23 06:30:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:40,120 INFO L225 Difference]: With dead ends: 96 [2022-07-23 06:30:40,120 INFO L226 Difference]: Without dead ends: 96 [2022-07-23 06:30:40,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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-23 06:30:40,121 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 126 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 95 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-23 06:30:40,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:30:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-23 06:30:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-23 06:30:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 92 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-23 06:30:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2022-07-23 06:30:40,124 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 41 [2022-07-23 06:30:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:40,124 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2022-07-23 06:30:40,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-23 06:30:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2022-07-23 06:30:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:30:40,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:40,125 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:40,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:40,351 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,SelfDestructingSolverStorable17 [2022-07-23 06:30:40,351 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:40,352 INFO L85 PathProgramCache]: Analyzing trace with hash -784093497, now seen corresponding path program 2 times [2022-07-23 06:30:40,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:40,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179065686] [2022-07-23 06:30:40,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:40,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:30:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:40,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179065686] [2022-07-23 06:30:40,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179065686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:40,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:40,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:30:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951514071] [2022-07-23 06:30:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:40,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:30:40,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:40,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:30:40,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:30:40,450 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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-23 06:30:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:40,521 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-07-23 06:30:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:40,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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 41 [2022-07-23 06:30:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:40,522 INFO L225 Difference]: With dead ends: 82 [2022-07-23 06:30:40,522 INFO L226 Difference]: Without dead ends: 82 [2022-07-23 06:30:40,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:30:40,523 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 101 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:40,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 181 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-23 06:30:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-23 06:30:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 78 states have internal predecessors, (84), 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-23 06:30:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-07-23 06:30:40,526 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 41 [2022-07-23 06:30:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:40,527 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-07-23 06:30:40,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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-23 06:30:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-07-23 06:30:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:30:40,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:40,527 INFO L195 NwaCegarLoop]: trace histogram [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-23 06:30:40,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 06:30:40,528 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2032584715, now seen corresponding path program 1 times [2022-07-23 06:30:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:40,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674866693] [2022-07-23 06:30:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 06:30:40,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:40,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674866693] [2022-07-23 06:30:40,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674866693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:40,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:40,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:30:40,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817906364] [2022-07-23 06:30:40,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:40,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:30:40,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:40,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:30:40,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:30:40,634 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 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-23 06:30:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:40,832 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-07-23 06:30:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:30:40,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 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-23 06:30:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:40,833 INFO L225 Difference]: With dead ends: 107 [2022-07-23 06:30:40,833 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 06:30:40,834 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-23 06:30:40,834 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 274 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:40,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 307 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 06:30:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2022-07-23 06:30:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 81 states have internal predecessors, (90), 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-23 06:30:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2022-07-23 06:30:40,837 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 45 [2022-07-23 06:30:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:40,837 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2022-07-23 06:30:40,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 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-23 06:30:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2022-07-23 06:30:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:30:40,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:40,837 INFO L195 NwaCegarLoop]: trace histogram [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-23 06:30:40,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 06:30:40,838 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2032584714, now seen corresponding path program 1 times [2022-07-23 06:30:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:40,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81232635] [2022-07-23 06:30:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:40,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 06:30:40,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:40,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81232635] [2022-07-23 06:30:40,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81232635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:40,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005165068] [2022-07-23 06:30:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:40,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:40,918 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-23 06:30:40,920 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-23 06:30:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:41,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:30:41,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 06:30:41,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 06:30:41,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005165068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:41,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:30:41,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-23 06:30:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994407457] [2022-07-23 06:30:41,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:41,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:30:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:41,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:30:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:30:41,205 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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-23 06:30:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:41,271 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-07-23 06:30:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:41,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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 45 [2022-07-23 06:30:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:41,272 INFO L225 Difference]: With dead ends: 107 [2022-07-23 06:30:41,272 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 06:30:41,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:30:41,273 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 118 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:41,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 311 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 06:30:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2022-07-23 06:30:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 97 states have internal predecessors, (115), 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-23 06:30:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2022-07-23 06:30:41,276 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 45 [2022-07-23 06:30:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:41,276 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2022-07-23 06:30:41,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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-23 06:30:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2022-07-23 06:30:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:30:41,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:41,277 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] [2022-07-23 06:30:41,305 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-23 06:30:41,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:41,491 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1454244195, now seen corresponding path program 1 times [2022-07-23 06:30:41,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:41,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842880438] [2022-07-23 06:30:41,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:41,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:41,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 06:30:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:41,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842880438] [2022-07-23 06:30:41,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842880438] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:41,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809590047] [2022-07-23 06:30:41,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:41,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:41,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:41,587 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-23 06:30:41,589 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-23 06:30:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:41,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:30:41,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 06:30:41,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 06:30:41,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809590047] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:41,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:30:41,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-07-23 06:30:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043416383] [2022-07-23 06:30:41,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:41,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:30:41,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:41,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:30:41,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:30:41,861 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 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-23 06:30:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:41,943 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-07-23 06:30:41,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:41,944 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 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 46 [2022-07-23 06:30:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:41,946 INFO L225 Difference]: With dead ends: 102 [2022-07-23 06:30:41,946 INFO L226 Difference]: Without dead ends: 102 [2022-07-23 06:30:41,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:30:41,946 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 230 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:41,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 243 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-23 06:30:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2022-07-23 06:30:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 92 states have internal predecessors, (109), 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-23 06:30:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2022-07-23 06:30:41,950 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 46 [2022-07-23 06:30:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:41,950 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2022-07-23 06:30:41,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 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-23 06:30:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2022-07-23 06:30:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 06:30:41,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:41,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:41,974 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-23 06:30:42,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-23 06:30:42,167 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:42,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash -748626798, now seen corresponding path program 2 times [2022-07-23 06:30:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:42,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747289631] [2022-07-23 06:30:42,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:42,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 06:30:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:42,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747289631] [2022-07-23 06:30:42,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747289631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:42,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:42,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:30:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258719887] [2022-07-23 06:30:42,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:42,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:42,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:42,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:42,249 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) 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-23 06:30:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:42,322 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-07-23 06:30:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:42,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) 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 50 [2022-07-23 06:30:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:42,324 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:30:42,324 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 06:30:42,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:30:42,324 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 88 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:42,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 239 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 06:30:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-07-23 06:30:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.394736842105263) internal successors, (106), 91 states have internal predecessors, (106), 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-23 06:30:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2022-07-23 06:30:42,328 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 50 [2022-07-23 06:30:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:42,328 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2022-07-23 06:30:42,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) 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-23 06:30:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2022-07-23 06:30:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 06:30:42,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:42,329 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:42,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 06:30:42,329 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:42,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:42,330 INFO L85 PathProgramCache]: Analyzing trace with hash -748626743, now seen corresponding path program 1 times [2022-07-23 06:30:42,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:42,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962191833] [2022-07-23 06:30:42,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:42,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:42,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:42,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 06:30:42,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:42,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962191833] [2022-07-23 06:30:42,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962191833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:42,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:42,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:30:42,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464714383] [2022-07-23 06:30:42,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:42,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:30:42,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:30:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:30:42,478 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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-23 06:30:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:42,728 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2022-07-23 06:30:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:30:42,729 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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 50 [2022-07-23 06:30:42,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:42,729 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:30:42,730 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:30:42,730 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-23 06:30:42,730 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 378 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:42,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 337 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:30:42,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:30:42,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2022-07-23 06:30:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 91 states have internal predecessors, (103), 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-23 06:30:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-07-23 06:30:42,733 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 50 [2022-07-23 06:30:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:42,733 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-07-23 06:30:42,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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-23 06:30:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-07-23 06:30:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 06:30:42,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:42,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:42,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 06:30:42,734 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:30:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1425902980, now seen corresponding path program 1 times [2022-07-23 06:30:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:42,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855404324] [2022-07-23 06:30:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:43,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:30:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:43,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855404324] [2022-07-23 06:30:43,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855404324] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:43,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554184828] [2022-07-23 06:30:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:43,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:43,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:43,318 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-23 06:30:43,319 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-23 06:30:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:43,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-23 06:30:43,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:43,529 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-23 06:30:43,627 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:30:43,628 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-23 06:30:43,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, 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-23 06:30:43,704 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:30:43,705 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 26 treesize of output 27 [2022-07-23 06:30:43,736 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:30:43,736 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-23 06:30:43,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:43,744 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-23 06:30:43,901 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:30:43,902 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-23 06:30:43,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:43,973 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-23 06:30:44,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:30:44,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:44,056 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 25 treesize of output 16 [2022-07-23 06:30:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 06:30:44,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:56,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (= 1 (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_2989) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (< |c_ULTIMATE.start_dll_circular_create_#res#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|))) is different from false [2022-07-23 06:30:58,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (v_ArrVal_2988 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|) (= (select |c_#valid| (select (store (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2988)) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2989)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) 1))) is different from false [2022-07-23 06:30:58,786 INFO L356 Elim1Store]: treesize reduction 5, result has 88.4 percent of original size [2022-07-23 06:30:58,787 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 47 treesize of output 46 [2022-07-23 06:30:58,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2986 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (v_ArrVal_2988 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2986))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2988)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2989))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|))) is different from false [2022-07-23 06:30:58,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2986 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (v_ArrVal_2988 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2986))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_2988)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2989))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)))) is different from false [2022-07-23 06:30:58,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2986 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2990 Int) (v_ArrVal_2988 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2985) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2986))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_2988)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2989))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)))) is different from false [2022-07-23 06:30:58,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:58,872 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 71 treesize of output 56 [2022-07-23 06:30:58,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 402 treesize of output 388 [2022-07-23 06:30:58,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:30:58,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:30:58,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:58,891 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 362 treesize of output 358 [2022-07-23 06:30:58,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:30:58,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:30:58,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:58,907 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 162 treesize of output 156 [2022-07-23 06:30:58,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:30:58,919 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 278 treesize of output 262 [2022-07-23 06:30:58,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:30:58,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:30:58,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:58,932 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 222 treesize of output 206 [2022-07-23 06:30:59,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554184828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:59,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:59,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 33 [2022-07-23 06:30:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713411626] [2022-07-23 06:30:59,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:59,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-23 06:30:59,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:59,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-23 06:30:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1846, Unknown=61, NotChecked=460, Total=2550 [2022-07-23 06:30:59,984 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 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-23 06:31:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:00,877 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2022-07-23 06:31:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 06:31:00,877 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 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 53 [2022-07-23 06:31:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:00,878 INFO L225 Difference]: With dead ends: 158 [2022-07-23 06:31:00,878 INFO L226 Difference]: Without dead ends: 158 [2022-07-23 06:31:00,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=380, Invalid=3001, Unknown=61, NotChecked=590, Total=4032 [2022-07-23 06:31:00,880 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 489 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:00,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1078 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 06:31:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-23 06:31:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2022-07-23 06:31:00,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 99 states have internal predecessors, (117), 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-23 06:31:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-07-23 06:31:00,883 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 53 [2022-07-23 06:31:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:00,883 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-07-23 06:31:00,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 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-23 06:31:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-07-23 06:31:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 06:31:00,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:00,884 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:31:00,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:01,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-23 06:31:01,099 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:01,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1425902981, now seen corresponding path program 1 times [2022-07-23 06:31:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:01,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255607902] [2022-07-23 06:31:01,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:01,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:01,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:31:01,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:01,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255607902] [2022-07-23 06:31:01,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255607902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:01,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328270261] [2022-07-23 06:31:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:01,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:01,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:31:01,836 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-23 06:31:01,840 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-23 06:31:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:02,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-23 06:31:02,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:02,072 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-23 06:31:02,277 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:31:02,277 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-23 06:31:02,337 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-23 06:31:02,390 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:02,390 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 26 treesize of output 27 [2022-07-23 06:31:02,473 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:02,474 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-23 06:31:02,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:02,527 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 22 treesize of output 21 [2022-07-23 06:31:02,532 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 6 treesize of output 5 [2022-07-23 06:31:02,757 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:02,757 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-23 06:31:02,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:02,764 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 35 [2022-07-23 06:31:02,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:02,913 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 38 treesize of output 33 [2022-07-23 06:31:02,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:02,920 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-07-23 06:31:03,078 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-23 06:31:03,081 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 28 treesize of output 16 [2022-07-23 06:31:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 06:31:03,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:04,168 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3195 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (forall ((v_ArrVal_3194 Int) (v_ArrVal_3195 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3194) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:31:04,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:04,208 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 66 treesize of output 70 [2022-07-23 06:31:11,944 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 157 treesize of output 149 [2022-07-23 06:31:11,948 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 148 [2022-07-23 06:31:11,951 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 160 treesize of output 158 [2022-07-23 06:31:12,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3188 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3188) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2022-07-23 06:31:12,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3188 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3188) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-07-23 06:31:12,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3187 (Array Int Int)) (v_ArrVal_3188 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3187) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3188) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-07-23 06:31:12,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:12,023 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 22 treesize of output 23 [2022-07-23 06:31:12,025 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 65 treesize of output 57 [2022-07-23 06:31:12,028 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-23 06:31:12,034 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-23 06:31:12,039 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-23 06:31:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-23 06:31:12,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328270261] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:31:12,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:31:12,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 26] total 72 [2022-07-23 06:31:12,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834240471] [2022-07-23 06:31:12,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:12,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-23 06:31:12,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:12,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-23 06:31:12,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4464, Unknown=4, NotChecked=548, Total=5256 [2022-07-23 06:31:12,587 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 73 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 64 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-23 06:31:14,553 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 12 (select |c_#length| .cse0)) (<= 12 (select |c_#length| .cse1)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse2 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3195 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse2 0) (not (= (select .cse3 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (forall ((v_ArrVal_3194 Int) (v_ArrVal_3195 Int)) (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_3194) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-23 06:31:15,149 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select |c_#length| (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 12 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse1 12) .cse0) (<= 0 (+ .cse1 8)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3195 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))))) (= .cse1 0) (not (= (select .cse2 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (forall ((v_ArrVal_3194 Int) (v_ArrVal_3195 Int)) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3194) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-23 06:31:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:16,774 INFO L93 Difference]: Finished difference Result 319 states and 356 transitions. [2022-07-23 06:31:16,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-23 06:31:16,774 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 64 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2022-07-23 06:31:16,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:16,776 INFO L225 Difference]: With dead ends: 319 [2022-07-23 06:31:16,776 INFO L226 Difference]: Without dead ends: 319 [2022-07-23 06:31:16,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=661, Invalid=8099, Unknown=6, NotChecked=1134, Total=9900 [2022-07-23 06:31:16,778 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 937 mSDsluCounter, 3517 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1404 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:16,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 3621 Invalid, 3524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2074 Invalid, 0 Unknown, 1404 Unchecked, 1.0s Time] [2022-07-23 06:31:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-23 06:31:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 102. [2022-07-23 06:31:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 98 states have internal predecessors, (112), 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-23 06:31:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2022-07-23 06:31:16,783 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 53 [2022-07-23 06:31:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:16,783 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2022-07-23 06:31:16,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 64 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-23 06:31:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2022-07-23 06:31:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 06:31:16,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:16,784 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:31:16,813 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-23 06:31:17,011 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,SelfDestructingSolverStorable25 [2022-07-23 06:31:17,012 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1850823601, now seen corresponding path program 2 times [2022-07-23 06:31:17,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:17,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932674707] [2022-07-23 06:31:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:17,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 06:31:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:17,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932674707] [2022-07-23 06:31:17,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932674707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:31:17,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:31:17,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:31:17,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857409848] [2022-07-23 06:31:17,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:31:17,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:31:17,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:17,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:31:17,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:31:17,128 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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-23 06:31:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:17,196 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-07-23 06:31:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:31:17,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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 56 [2022-07-23 06:31:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:17,197 INFO L225 Difference]: With dead ends: 88 [2022-07-23 06:31:17,197 INFO L226 Difference]: Without dead ends: 88 [2022-07-23 06:31:17,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:31:17,198 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 157 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:17,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 150 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:31:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-23 06:31:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-23 06:31:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 84 states have internal predecessors, (90), 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-23 06:31:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-07-23 06:31:17,201 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 56 [2022-07-23 06:31:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:17,201 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-07-23 06:31:17,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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-23 06:31:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-07-23 06:31:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 06:31:17,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:17,202 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:31:17,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 06:31:17,203 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:17,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1490386454, now seen corresponding path program 1 times [2022-07-23 06:31:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:17,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395183093] [2022-07-23 06:31:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:17,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:17,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:18,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:31:18,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:18,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395183093] [2022-07-23 06:31:18,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395183093] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:18,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105623084] [2022-07-23 06:31:18,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:18,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:18,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:31:18,139 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-23 06:31:18,139 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-23 06:31:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:18,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-23 06:31:18,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:18,373 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-23 06:31:18,553 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:31:18,553 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-23 06:31:18,636 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-23 06:31:18,699 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-23 06:31:18,827 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:18,827 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-23 06:31:18,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:18,839 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 26 treesize of output 21 [2022-07-23 06:31:18,844 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 6 treesize of output 5 [2022-07-23 06:31:19,220 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:19,221 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 73 treesize of output 66 [2022-07-23 06:31:19,225 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 29 treesize of output 21 [2022-07-23 06:31:19,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:19,229 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-23 06:31:19,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:19,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:19,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:19,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-07-23 06:31:19,421 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 30 treesize of output 32 [2022-07-23 06:31:19,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:19,434 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 36 [2022-07-23 06:31:19,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:19,759 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 0 case distinctions, treesize of input 59 treesize of output 35 [2022-07-23 06:31:19,765 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-23 06:31:19,924 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-23 06:31:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 06:31:20,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:20,550 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3521) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_3519)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_3520)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (+ (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3521) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_3519)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_3520)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2022-07-23 06:31:20,577 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) is different from false [2022-07-23 06:31:20,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:20,627 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-23 06:31:20,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:20,637 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-23 06:31:20,644 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-23 06:31:20,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:20,687 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-23 06:31:20,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:20,698 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-23 06:31:20,706 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-23 06:31:20,758 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= .cse1 .cse0))) is different from false [2022-07-23 06:31:20,811 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| 8) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2022-07-23 06:31:20,839 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 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_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (<= .cse2 .cse1))) is different from false [2022-07-23 06:31:20,897 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_dll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 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_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 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_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (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_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-07-23 06:31:20,919 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0)))))) is different from false [2022-07-23 06:31:20,941 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2022-07-23 06:31:20,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:20,956 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 19 treesize of output 17 [2022-07-23 06:31:20,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:20,960 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 26 treesize of output 24 [2022-07-23 06:31:21,028 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3511 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2022-07-23 06:31:21,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3511 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-23 06:31:21,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3511 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3510) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-23 06:31:21,047 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:21,047 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 22 treesize of output 23 [2022-07-23 06:31:21,049 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 65 treesize of output 57 [2022-07-23 06:31:21,054 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-23 06:31:21,057 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-23 06:31:21,061 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-23 06:31:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-23 06:31:21,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105623084] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:31:21,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:31:21,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 31] total 83 [2022-07-23 06:31:21,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190867480] [2022-07-23 06:31:21,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:21,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-07-23 06:31:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:21,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-07-23 06:31:21,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4919, Unknown=11, NotChecked=1650, Total=6806 [2022-07-23 06:31:21,663 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 83 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 74 states have internal predecessors, (142), 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-23 06:31:22,967 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse2 (select .cse4 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse0 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (= .cse2 .cse0) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-07-23 06:31:23,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse2))))) (<= 0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 0)))) is different from false [2022-07-23 06:31:23,906 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse2 (select .cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 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_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 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_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (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_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse3 .cse2) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse3)) (= |c_ULTIMATE.start_main_~i~0#1| (+ |c_ULTIMATE.start_main_~len~0#1| (- 1))) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:31:24,610 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse4 (select .cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (<= .cse2 .cse3) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 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_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ (- 1) .cse3)) (<= .cse3 .cse2) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|) .cse4) (<= |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_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:31:25,594 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse4 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (select .cse6 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| .cse1) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| .cse2) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (<= .cse3 .cse4) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ (- 1) .cse4)) (<= .cse4 .cse3) (= .cse1 0) (= .cse2 .cse5) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| 8) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:31:26,564 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (select .cse6 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (= .cse1 |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (<= .cse2 .cse3) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (= .cse5 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ (- 1) .cse3)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= .cse3 .cse2) (= .cse5 0) (= .cse1 .cse4) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:31:26,570 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (select |c_#memory_int| .cse6)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (select .cse7 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select .cse0 8) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (+ (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))))) (= (+ (- 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (select .cse0 (+ .cse5 8))) (= .cse5 0) (= .cse6 .cse2) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse6)) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-23 06:31:26,577 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse5 (select |c_#memory_int| .cse7))) (let ((.cse0 (+ (select .cse5 8) 1)) (.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (select .cse8 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (+ (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))))) (= (+ (- 1) .cse1) (select .cse5 (+ .cse6 8))) (= .cse6 0) (= .cse7 .cse2) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse7)) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-23 06:31:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:28,182 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-07-23 06:31:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 06:31:28,183 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 74 states have internal predecessors, (142), 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 57 [2022-07-23 06:31:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:28,183 INFO L225 Difference]: With dead ends: 88 [2022-07-23 06:31:28,183 INFO L226 Difference]: Without dead ends: 88 [2022-07-23 06:31:28,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 106 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=481, Invalid=7408, Unknown=19, NotChecked=3648, Total=11556 [2022-07-23 06:31:28,187 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 195 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 784 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:28,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1669 Invalid, 2262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1417 Invalid, 0 Unknown, 784 Unchecked, 0.6s Time] [2022-07-23 06:31:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-23 06:31:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-23 06:31:28,189 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-23 06:31:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-07-23 06:31:28,190 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 57 [2022-07-23 06:31:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:28,190 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-07-23 06:31:28,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 74 states have internal predecessors, (142), 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-23 06:31:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-07-23 06:31:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 06:31:28,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:28,191 INFO L195 NwaCegarLoop]: trace histogram [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-23 06:31:28,213 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-23 06:31:28,403 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,SelfDestructingSolverStorable27 [2022-07-23 06:31:28,404 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:28,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1792642665, now seen corresponding path program 1 times [2022-07-23 06:31:28,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:28,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958059034] [2022-07-23 06:31:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:28,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:28,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:28,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 06:31:28,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:28,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958059034] [2022-07-23 06:31:28,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958059034] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:28,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775957792] [2022-07-23 06:31:28,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:28,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:28,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:31:28,810 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-23 06:31:28,812 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-23 06:31:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:29,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-23 06:31:29,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:29,187 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-23 06:31:29,337 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-23 06:31:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 06:31:29,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:29,545 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-23 06:31:29,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:29,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 06:31:29,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775957792] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:31:29,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:31:29,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 38 [2022-07-23 06:31:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225277573] [2022-07-23 06:31:29,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:29,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-23 06:31:29,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:29,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-23 06:31:29,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2022-07-23 06:31:29,671 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-23 06:31:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:30,489 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-07-23 06:31:30,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:31:30,489 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2022-07-23 06:31:30,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:30,490 INFO L225 Difference]: With dead ends: 122 [2022-07-23 06:31:30,490 INFO L226 Difference]: Without dead ends: 122 [2022-07-23 06:31:30,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=408, Invalid=2244, Unknown=0, NotChecked=0, Total=2652 [2022-07-23 06:31:30,491 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 837 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:30,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 942 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:31:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-23 06:31:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 92. [2022-07-23 06:31:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 88 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-23 06:31:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-07-23 06:31:30,494 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 64 [2022-07-23 06:31:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:30,494 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-07-23 06:31:30,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-23 06:31:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-07-23 06:31:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-23 06:31:30,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:30,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:31:30,521 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-23 06:31:30,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:30,716 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash 3674256, now seen corresponding path program 2 times [2022-07-23 06:31:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:30,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338361210] [2022-07-23 06:31:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:30,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:30,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 06:31:30,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:30,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338361210] [2022-07-23 06:31:30,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338361210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:30,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258942483] [2022-07-23 06:31:30,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:31:30,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:30,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:31:30,808 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-23 06:31:30,836 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-23 06:31:31,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:31:31,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:31:31,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:31:31,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 06:31:31,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 06:31:31,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258942483] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:31:31,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:31:31,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-07-23 06:31:31,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154886907] [2022-07-23 06:31:31,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:31,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:31:31,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:31,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:31:31,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:31:31,361 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 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-23 06:31:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:31,436 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-07-23 06:31:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:31:31,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 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 67 [2022-07-23 06:31:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:31,437 INFO L225 Difference]: With dead ends: 83 [2022-07-23 06:31:31,437 INFO L226 Difference]: Without dead ends: 83 [2022-07-23 06:31:31,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:31:31,438 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 226 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:31,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 192 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:31:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-23 06:31:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-23 06:31:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 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-23 06:31:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-07-23 06:31:31,441 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2022-07-23 06:31:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:31,442 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-07-23 06:31:31,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 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-23 06:31:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-07-23 06:31:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-23 06:31:31,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:31,443 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] [2022-07-23 06:31:31,470 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-23 06:31:31,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:31,670 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:31,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash 775968223, now seen corresponding path program 1 times [2022-07-23 06:31:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:31,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149218159] [2022-07-23 06:31:31,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:31,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:31,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:31,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-23 06:31:31,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:31,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149218159] [2022-07-23 06:31:31,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149218159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:31:31,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:31:31,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:31:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052136495] [2022-07-23 06:31:31,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:31:31,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:31:31,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:31,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:31:31,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:31:31,741 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-23 06:31:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:31,828 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-07-23 06:31:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:31:31,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 68 [2022-07-23 06:31:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:31,829 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:31:31,830 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 06:31:31,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:31:31,830 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 99 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:31,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 220 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:31:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 06:31:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2022-07-23 06:31:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 82 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-23 06:31:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-07-23 06:31:31,832 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 68 [2022-07-23 06:31:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:31,833 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-07-23 06:31:31,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-23 06:31:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-07-23 06:31:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-23 06:31:31,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:31,833 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] [2022-07-23 06:31:31,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-23 06:31:31,833 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:31,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash 775968224, now seen corresponding path program 1 times [2022-07-23 06:31:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:31,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354049507] [2022-07-23 06:31:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:31,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 06:31:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:32,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354049507] [2022-07-23 06:31:32,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354049507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:31:32,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:31:32,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:31:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975440653] [2022-07-23 06:31:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:31:32,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:31:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:32,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:31:32,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:31:32,013 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 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-23 06:31:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:32,249 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-07-23 06:31:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:31:32,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 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 68 [2022-07-23 06:31:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:32,251 INFO L225 Difference]: With dead ends: 84 [2022-07-23 06:31:32,251 INFO L226 Difference]: Without dead ends: 84 [2022-07-23 06:31:32,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:31:32,251 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 196 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:32,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 245 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:31:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-23 06:31:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-23 06:31:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.178082191780822) 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-23 06:31:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-07-23 06:31:32,253 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 68 [2022-07-23 06:31:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:32,254 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-07-23 06:31:32,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 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-23 06:31:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-07-23 06:31:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-23 06:31:32,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:32,254 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] [2022-07-23 06:31:32,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-23 06:31:32,254 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:32,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1714754975, now seen corresponding path program 1 times [2022-07-23 06:31:32,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:32,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483730404] [2022-07-23 06:31:32,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:32,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:32,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:32,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 06:31:32,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:32,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483730404] [2022-07-23 06:31:32,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483730404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:31:32,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:31:32,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:31:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286714490] [2022-07-23 06:31:32,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:31:32,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:31:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:32,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:31:32,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:31:32,372 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 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-23 06:31:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:32,524 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-07-23 06:31:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:31:32,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 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 69 [2022-07-23 06:31:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:32,525 INFO L225 Difference]: With dead ends: 84 [2022-07-23 06:31:32,525 INFO L226 Difference]: Without dead ends: 84 [2022-07-23 06:31:32,525 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-23 06:31:32,526 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 188 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:32,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 265 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:31:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-23 06:31:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-23 06:31:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1643835616438356) 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-23 06:31:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-07-23 06:31:32,528 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 69 [2022-07-23 06:31:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:32,528 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-07-23 06:31:32,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 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-23 06:31:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-07-23 06:31:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 06:31:32,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:32,528 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] [2022-07-23 06:31:32,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-23 06:31:32,529 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:32,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:32,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1355436959, now seen corresponding path program 1 times [2022-07-23 06:31:32,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:32,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279784008] [2022-07-23 06:31:32,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:32,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-23 06:31:32,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:32,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279784008] [2022-07-23 06:31:32,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279784008] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:32,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015272088] [2022-07-23 06:31:32,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:32,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:32,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:31:32,638 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-23 06:31:32,640 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-23 06:31:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:32,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-23 06:31:32,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:33,223 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-23 06:31:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:31:33,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:33,323 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-23 06:31:33,323 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-23 06:31:33,379 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-23 06:31:33,380 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-23 06:31:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-23 06:31:33,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015272088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:31:33,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:31:33,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2022-07-23 06:31:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225473476] [2022-07-23 06:31:33,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:33,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-23 06:31:33,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:33,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-23 06:31:33,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-07-23 06:31:33,436 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 27 states, 26 states have (on average 4.346153846153846) internal successors, (113), 25 states have internal predecessors, (113), 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-23 06:31:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:33,942 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-07-23 06:31:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 06:31:33,943 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.346153846153846) internal successors, (113), 25 states have internal predecessors, (113), 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 71 [2022-07-23 06:31:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:33,944 INFO L225 Difference]: With dead ends: 92 [2022-07-23 06:31:33,944 INFO L226 Difference]: Without dead ends: 92 [2022-07-23 06:31:33,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 127 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-23 06:31:33,945 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 310 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:33,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 555 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:31:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-23 06:31:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-07-23 06:31:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.162162162162162) 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-23 06:31:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-07-23 06:31:33,947 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 71 [2022-07-23 06:31:33,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:33,948 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-07-23 06:31:33,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.346153846153846) internal successors, (113), 25 states have internal predecessors, (113), 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-23 06:31:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-07-23 06:31:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 06:31:33,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:33,949 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] [2022-07-23 06:31:33,978 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-23 06:31:34,175 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,SelfDestructingSolverStorable33 [2022-07-23 06:31:34,176 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1355436960, now seen corresponding path program 1 times [2022-07-23 06:31:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:34,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942632049] [2022-07-23 06:31:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 06:31:34,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:34,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942632049] [2022-07-23 06:31:34,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942632049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:34,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732534371] [2022-07-23 06:31:34,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:34,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:34,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:31:34,940 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-23 06:31:34,964 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-23 06:31:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:35,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-23 06:31:35,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:35,242 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-23 06:31:35,419 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:31:35,419 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-23 06:31:35,507 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-23 06:31:35,511 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-23 06:31:35,587 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:35,587 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 36 treesize of output 35 [2022-07-23 06:31:35,591 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-23 06:31:35,702 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:31:35,702 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:31:35,708 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-23 06:31:35,720 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:35,720 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-23 06:31:35,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:35,763 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-23 06:31:35,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:35,771 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 26 treesize of output 21 [2022-07-23 06:31:35,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:35,977 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 0 case distinctions, treesize of input 31 treesize of output 11 [2022-07-23 06:31:36,070 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 23 treesize of output 23 [2022-07-23 06:31:36,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:36,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:36,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:36,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:36,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-23 06:31:36,605 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-23 06:31:36,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:36,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:36,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2022-07-23 06:31:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-23 06:31:36,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:36,914 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:36,914 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-23 06:31:37,040 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:37,040 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 28 treesize of output 32 [2022-07-23 06:31:38,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:38,824 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 66 treesize of output 59 [2022-07-23 06:31:38,830 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 530 treesize of output 518 [2022-07-23 06:31:38,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:38,837 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 514 treesize of output 394 [2022-07-23 06:31:38,849 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 1034 treesize of output 966 [2022-07-23 06:31:38,860 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 962 treesize of output 930 [2022-07-23 06:31:38,877 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 930 treesize of output 866 [2022-07-23 06:31:38,885 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 866 treesize of output 850 [2022-07-23 06:31:38,892 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 850 treesize of output 842 [2022-07-23 06:31:38,899 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 842 treesize of output 838 [2022-07-23 06:31:39,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732534371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:39,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:31:39,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 54 [2022-07-23 06:31:39,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834938025] [2022-07-23 06:31:39,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:39,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-23 06:31:39,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:39,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-23 06:31:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5555, Unknown=11, NotChecked=0, Total=5852 [2022-07-23 06:31:39,336 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:31:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:41,662 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-07-23 06:31:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-23 06:31:41,662 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2022-07-23 06:31:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:41,663 INFO L225 Difference]: With dead ends: 93 [2022-07-23 06:31:41,663 INFO L226 Difference]: Without dead ends: 93 [2022-07-23 06:31:41,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=731, Invalid=9158, Unknown=11, NotChecked=0, Total=9900 [2022-07-23 06:31:41,664 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 586 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:41,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1049 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 06:31:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-23 06:31:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2022-07-23 06:31:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.144736842105263) internal successors, (87), 82 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-23 06:31:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-07-23 06:31:41,667 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 71 [2022-07-23 06:31:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:41,667 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-07-23 06:31:41,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:31:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-07-23 06:31:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-23 06:31:41,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:41,668 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-23 06:31:41,688 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-23 06:31:41,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:41,875 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:41,876 INFO L85 PathProgramCache]: Analyzing trace with hash -931128602, now seen corresponding path program 1 times [2022-07-23 06:31:41,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:41,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828356305] [2022-07-23 06:31:41,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:41,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:41,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:41,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 06:31:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:42,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828356305] [2022-07-23 06:31:42,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828356305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:31:42,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:31:42,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:31:42,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648362644] [2022-07-23 06:31:42,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:31:42,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:31:42,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:42,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:31:42,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:31:42,011 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 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-23 06:31:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:42,185 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-07-23 06:31:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:31:42,186 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 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 72 [2022-07-23 06:31:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:42,187 INFO L225 Difference]: With dead ends: 85 [2022-07-23 06:31:42,187 INFO L226 Difference]: Without dead ends: 85 [2022-07-23 06:31:42,187 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-23 06:31:42,187 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 173 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:42,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 230 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:31:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-23 06:31:42,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-23 06:31:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.118421052631579) internal successors, (85), 81 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-23 06:31:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-07-23 06:31:42,190 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 72 [2022-07-23 06:31:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:42,190 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-07-23 06:31:42,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 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-23 06:31:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-07-23 06:31:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-23 06:31:42,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:42,191 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, 1, 1] [2022-07-23 06:31:42,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-23 06:31:42,191 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1459966101, now seen corresponding path program 1 times [2022-07-23 06:31:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:42,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152571364] [2022-07-23 06:31:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:42,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:42,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 06:31:42,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:42,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152571364] [2022-07-23 06:31:42,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152571364] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:42,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138853392] [2022-07-23 06:31:42,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:42,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:42,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:31:42,789 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-23 06:31:42,791 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-23 06:31:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:43,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-23 06:31:43,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:43,135 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-23 06:31:43,207 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-23 06:31:43,276 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:31:43,277 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-23 06:31:43,364 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-23 06:31:43,432 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:43,432 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 35 treesize of output 34 [2022-07-23 06:31:43,540 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:43,540 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-23 06:31:43,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:43,560 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-23 06:31:43,737 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:43,738 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-23 06:31:43,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:43,817 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-23 06:31:43,971 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-23 06:31:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-23 06:31:44,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:44,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-23 06:31:44,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4974) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-23 06:31:44,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4974) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-23 06:31:44,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_4974) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-23 06:31:44,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int 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_4974) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-23 06:31:44,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_4974) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2022-07-23 06:31:44,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4974) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-23 06:31:44,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:44,742 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 73 treesize of output 58 [2022-07-23 06:31:44,745 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 216 treesize of output 208 [2022-07-23 06:31:44,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:44,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 182 treesize of output 174 [2022-07-23 06:31:44,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:44,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:44,766 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 76 treesize of output 70 [2022-07-23 06:31:44,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:44,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:44,770 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 138 treesize of output 126 [2022-07-23 06:31:44,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:44,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:44,775 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 68 treesize of output 60 [2022-07-23 06:31:44,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138853392] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:44,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:31:44,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 39 [2022-07-23 06:31:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068260372] [2022-07-23 06:31:44,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:44,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-23 06:31:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:44,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-23 06:31:44,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2189, Unknown=9, NotChecked=700, Total=3080 [2022-07-23 06:31:44,971 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 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-23 06:31:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:46,048 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-07-23 06:31:46,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 06:31:46,048 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 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 74 [2022-07-23 06:31:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:46,049 INFO L225 Difference]: With dead ends: 90 [2022-07-23 06:31:46,049 INFO L226 Difference]: Without dead ends: 90 [2022-07-23 06:31:46,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=372, Invalid=3429, Unknown=9, NotChecked=882, Total=4692 [2022-07-23 06:31:46,049 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 214 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:46,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 731 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 06:31:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-23 06:31:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2022-07-23 06:31:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 82 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-23 06:31:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-07-23 06:31:46,053 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 74 [2022-07-23 06:31:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:46,054 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-07-23 06:31:46,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 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-23 06:31:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-07-23 06:31:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-23 06:31:46,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:46,055 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, 1, 1, 1] [2022-07-23 06:31:46,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-23 06:31:46,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:46,275 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:31:46,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1941762549, now seen corresponding path program 1 times [2022-07-23 06:31:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:31:46,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571472852] [2022-07-23 06:31:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:31:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:31:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:31:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-23 06:31:46,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:31:46,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571472852] [2022-07-23 06:31:46,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571472852] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:46,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351097630] [2022-07-23 06:31:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:46,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:31:46,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:31:46,716 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-23 06:31:46,726 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-23 06:31:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:47,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-23 06:31:47,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:47,083 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-23 06:31:47,184 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:31:47,185 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-23 06:31:47,239 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-23 06:31:47,278 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-23 06:31:47,343 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-23 06:31:47,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:47,352 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 26 treesize of output 21 [2022-07-23 06:31:47,572 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:47,572 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 32 treesize of output 31 [2022-07-23 06:31:47,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:47,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:47,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:47,636 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:47,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-07-23 06:31:47,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:47,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:47,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 06:31:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 06:31:47,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:50,612 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,629 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (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_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5178) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5178) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5178)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5175))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5178))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5175))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5178))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5174 (Array Int Int))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5174) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5175))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5178))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-23 06:31:50,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:50,732 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 72 treesize of output 57 [2022-07-23 06:31:50,734 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 209 treesize of output 201 [2022-07-23 06:31:50,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:50,743 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 282 treesize of output 279 [2022-07-23 06:31:50,748 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-23 06:31:50,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:50,760 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 432 treesize of output 433 [2022-07-23 06:31:50,771 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:50,771 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 475 treesize of output 475 [2022-07-23 06:31:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2022-07-23 06:31:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351097630] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:31:51,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:31:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 28] total 70 [2022-07-23 06:31:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701081746] [2022-07-23 06:31:51,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:51,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-23 06:31:51,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:31:51,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-23 06:31:51,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3227, Unknown=13, NotChecked=1364, Total=4830 [2022-07-23 06:31:51,549 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:31:52,253 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5175))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5178))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))))) is different from false [2022-07-23 06:31:52,678 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5175))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5178))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2022-07-23 06:31:53,058 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5178)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2022-07-23 06:31:58,289 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (select .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse1)) (<= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse2 (select .cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select .cse4 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (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_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (= .cse1 (select .cse5 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:31:58,647 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:31:59,013 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| .cse0) (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:31:59,394 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:31:59,690 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:31:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:59,945 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-07-23 06:31:59,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:31:59,945 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 75 [2022-07-23 06:31:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:59,946 INFO L225 Difference]: With dead ends: 84 [2022-07-23 06:31:59,946 INFO L226 Difference]: Without dead ends: 84 [2022-07-23 06:31:59,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=296, Invalid=4049, Unknown=21, NotChecked=2774, Total=7140 [2022-07-23 06:31:59,947 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 58 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 667 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:59,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1362 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 845 Invalid, 0 Unknown, 667 Unchecked, 0.4s Time] [2022-07-23 06:31:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-23 06:31:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-07-23 06:31:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 79 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-23 06:31:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-07-23 06:31:59,949 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 75 [2022-07-23 06:31:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:59,949 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-07-23 06:31:59,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:31:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-07-23 06:31:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 06:31:59,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:59,950 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:31:59,970 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-23 06:32:00,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:00,160 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:00,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1283862180, now seen corresponding path program 1 times [2022-07-23 06:32:00,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:00,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342089209] [2022-07-23 06:32:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:32:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:00,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:32:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 06:32:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:00,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342089209] [2022-07-23 06:32:00,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342089209] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:00,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210853922] [2022-07-23 06:32:00,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:00,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:00,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:00,974 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-23 06:32:00,975 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-23 06:32:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:01,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 133 conjunts are in the unsatisfiable core [2022-07-23 06:32:01,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:01,332 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-23 06:32:01,507 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:32:01,507 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-23 06:32:01,594 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-23 06:32:01,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, 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-23 06:32:01,670 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:32:01,670 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 36 treesize of output 35 [2022-07-23 06:32:01,674 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-23 06:32:01,794 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 06:32:01,794 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-23 06:32:01,796 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-23 06:32:01,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:01,847 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:32:01,848 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-23 06:32:01,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:01,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-23 06:32:02,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:02,167 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:32:02,167 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-23 06:32:02,178 INFO L356 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-07-23 06:32:02,178 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-23 06:32:02,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:02,323 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:32:02,323 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-23 06:32:02,336 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-23 06:32:02,661 INFO L356 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-07-23 06:32:02,661 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-23 06:32:02,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:02,667 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-23 06:32:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 06:32:02,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:04,312 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5397 Int)) (or (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5397)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5397)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5396) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5397)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))) (forall ((v_ArrVal_5397 Int)) (or (forall ((v_ArrVal_5396 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5396) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5397)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5397)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5397)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0))))) is different from false [2022-07-23 06:32:04,390 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5397 Int)) (or (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_5397 Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|)) (forall ((v_ArrVal_5396 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0))))))) is different from false [2022-07-23 06:32:04,560 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5393)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_5397 Int)) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5393)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (select (store .cse2 |c_ULTIMATE.start_main_~s~0#1.base| .cse3) (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))))))) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_5397 Int)) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((v_ArrVal_5396 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse4 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))))))) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse5 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse5 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse5 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:32:04,709 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5397 Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|)) (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_5397 Int)) (or (forall ((v_ArrVal_5396 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) .cse2 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) .cse2 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (select (store .cse3 |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5394 Int) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) .cse5 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) .cse5 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|))))) is different from false [2022-07-23 06:32:04,825 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse1 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse0) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))))) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse4 (select (store (select (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) .cse6 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) .cse4) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= (select (let ((.cse7 (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (select (store .cse7 |c_ULTIMATE.start_main_~s~0#1.base| .cse8) (select .cse8 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse11 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))))) is different from false [2022-07-23 06:32:04,979 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 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|)) (.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_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|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) .cse0) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))))) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_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|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (= |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_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))) (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_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|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= (select (let ((.cse5 (let ((.cse7 (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| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (select (store .cse5 |c_ULTIMATE.start_main_~s~0#1.base| .cse6) (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse8 (let ((.cse11 (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| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_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|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= (select (select (store .cse8 |c_ULTIMATE.start_main_~s~0#1.base| .cse9) .cse10) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (= .cse10 |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2022-07-23 06:32:05,056 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (= (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse3 (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (= (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse4) .cse5) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))))) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse8 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse7 (store (select |c_#memory_$Pointer$.offset| .cse7) .cse8 v_ArrVal_5394)) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) .cse8 v_ArrVal_5393)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse10 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 v_ArrVal_5393)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 v_ArrVal_5394)) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_5396) .cse11) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (= .cse11 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))))) is different from false [2022-07-23 06:32:05,147 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_5394)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_5393)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) .cse7 v_ArrVal_5393)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse5) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse6 (store (select |c_#memory_$Pointer$.offset| .cse6) .cse7 v_ArrVal_5394)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5396) .cse5) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse8 (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (= (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse9) .cse10) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse10) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))))))) is different from false [2022-07-23 06:32:20,091 WARN L233 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:32:51,032 WARN L233 SmtUtils]: Spent 11.29s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:32:51,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:51,724 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 2933 treesize of output 2750 [2022-07-23 06:32:52,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:52,436 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 2750 treesize of output 1734 [2022-07-23 06:33:17,317 WARN L233 SmtUtils]: Spent 20.81s on a formula simplification that was a NOOP. DAG size: 120 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-23 06:33:17,318 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:33:17,348 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 7502032846 treesize of output 7365402014