./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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-ext3-properties/sll_circular_traversal-1.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 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:31:02,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:31:02,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:31:02,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:31:02,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:31:02,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:31:02,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:31:02,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:31:02,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:31:02,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:31:02,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:31:02,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:31:02,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:31:02,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:31:02,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:31:02,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:31:02,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:31:02,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:31:02,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:31:02,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:31:02,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:31:02,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:31:02,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:31:02,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:31:02,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:31:02,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:31:02,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:31:02,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:31:02,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:31:02,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:31:02,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:31:02,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:31:02,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:31:02,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:31:02,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:31:02,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:31:02,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:31:02,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:31:02,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:31:02,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:31:02,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:31:02,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:31:02,779 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:31:02,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:31:02,782 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:31:02,782 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:31:02,783 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:31:02,783 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:31:02,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:31:02,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:31:02,784 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:31:02,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:31:02,785 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:31:02,785 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:31:02,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:31:02,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:31:02,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:31:02,786 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:31:02,786 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:31:02,786 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:31:02,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:31:02,786 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:31:02,786 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:31:02,786 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:31:02,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:31:02,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:31:02,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:31:02,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:31:02,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:31:02,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:31:02,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:31:02,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:31:02,788 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:31:02,788 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:31:02,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:31:02,789 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:31:02,789 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-02-15 22:31:03,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:31:03,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:31:03,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:31:03,046 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:31:03,047 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:31:03,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-02-15 22:31:04,219 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:31:04,483 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:31:04,485 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-02-15 22:31:04,500 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6eb5ea5/7e01a76d7fda4a7a855dbab08680038d/FLAGa44cb7c3e [2023-02-15 22:31:04,514 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6eb5ea5/7e01a76d7fda4a7a855dbab08680038d [2023-02-15 22:31:04,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:31:04,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:31:04,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:31:04,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:31:04,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:31:04,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c31cc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04, skipping insertion in model container [2023-02-15 22:31:04,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:31:04,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:31:04,773 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-02-15 22:31:04,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:31:04,788 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:31:04,813 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-02-15 22:31:04,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:31:04,839 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:31:04,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04 WrapperNode [2023-02-15 22:31:04,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:31:04,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:31:04,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:31:04,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:31:04,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,889 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2023-02-15 22:31:04,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:31:04,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:31:04,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:31:04,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:31:04,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,913 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:31:04,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:31:04,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:31:04,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:31:04,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (1/1) ... [2023-02-15 22:31:04,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:31:04,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:04,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:31:04,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:31:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 22:31:04,992 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 22:31:04,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:31:04,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:31:04,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:31:04,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:31:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:31:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:31:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:31:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:31:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:31:04,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:31:05,095 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:31:05,096 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:31:05,125 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 22:31:05,268 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:31:05,272 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:31:05,272 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 22:31:05,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:05 BoogieIcfgContainer [2023-02-15 22:31:05,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:31:05,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:31:05,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:31:05,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:31:05,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:31:04" (1/3) ... [2023-02-15 22:31:05,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600dc0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:31:05, skipping insertion in model container [2023-02-15 22:31:05,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:04" (2/3) ... [2023-02-15 22:31:05,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600dc0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:31:05, skipping insertion in model container [2023-02-15 22:31:05,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:05" (3/3) ... [2023-02-15 22:31:05,279 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-02-15 22:31:05,290 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:31:05,290 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-02-15 22:31:05,316 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:31:05,319 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56633fa5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:31:05,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-02-15 22:31:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 22:31:05,326 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:05,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 22:31:05,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-02-15 22:31:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:05,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575052105] [2023-02-15 22:31:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:05,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:31:05,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:05,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575052105] [2023-02-15 22:31:05,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575052105] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:05,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:05,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:31:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313489626] [2023-02-15 22:31:05,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:05,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:31:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:05,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:31:05,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:05,563 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:05,679 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2023-02-15 22:31:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:31:05,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-15 22:31:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:05,687 INFO L225 Difference]: With dead ends: 92 [2023-02-15 22:31:05,687 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 22:31:05,689 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 [2023-02-15 22:31:05,691 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:05,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:31:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 22:31:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2023-02-15 22:31:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-02-15 22:31:05,726 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 4 [2023-02-15 22:31:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:05,726 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-02-15 22:31:05,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-02-15 22:31:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 22:31:05,727 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:05,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 22:31:05,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:31:05,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:05,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-02-15 22:31:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:05,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095405911] [2023-02-15 22:31:05,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:31:05,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:05,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095405911] [2023-02-15 22:31:05,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095405911] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:05,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:05,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:31:05,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786968736] [2023-02-15 22:31:05,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:05,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:31:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:31:05,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:05,854 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:05,900 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2023-02-15 22:31:05,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:31:05,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-15 22:31:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:05,905 INFO L225 Difference]: With dead ends: 58 [2023-02-15 22:31:05,905 INFO L226 Difference]: Without dead ends: 58 [2023-02-15 22:31:05,905 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 [2023-02-15 22:31:05,906 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:05,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 42 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:31:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-15 22:31:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-15 22:31:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2023-02-15 22:31:05,910 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 4 [2023-02-15 22:31:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:05,910 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2023-02-15 22:31:05,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2023-02-15 22:31:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:31:05,911 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:05,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:05,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:31:05,912 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:05,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:05,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2023-02-15 22:31:05,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:05,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502548992] [2023-02-15 22:31:05,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:05,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:31:06,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:06,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502548992] [2023-02-15 22:31:06,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502548992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:06,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:06,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:31:06,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116413961] [2023-02-15 22:31:06,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:06,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:31:06,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:06,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:31:06,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:06,013 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:06,084 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2023-02-15 22:31:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:31:06,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 22:31:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:06,086 INFO L225 Difference]: With dead ends: 98 [2023-02-15 22:31:06,086 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 22:31:06,086 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 [2023-02-15 22:31:06,087 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:06,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 118 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:31:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 22:31:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2023-02-15 22:31:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-02-15 22:31:06,093 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9 [2023-02-15 22:31:06,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:06,094 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-02-15 22:31:06,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-02-15 22:31:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:31:06,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:06,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:06,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:31:06,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2023-02-15 22:31:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:06,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91293892] [2023-02-15 22:31:06,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:06,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:31:06,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:06,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91293892] [2023-02-15 22:31:06,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91293892] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:06,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:06,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:31:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900356852] [2023-02-15 22:31:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:06,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:31:06,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:06,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:31:06,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:06,266 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:06,343 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-02-15 22:31:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:31:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 22:31:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:06,344 INFO L225 Difference]: With dead ends: 98 [2023-02-15 22:31:06,345 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 22:31:06,345 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 [2023-02-15 22:31:06,346 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 50 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:06,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 128 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:31:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 22:31:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 54. [2023-02-15 22:31:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-02-15 22:31:06,355 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2023-02-15 22:31:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:06,355 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-02-15 22:31:06,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-02-15 22:31:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:31:06,356 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:06,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:06,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:31:06,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:06,359 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2023-02-15 22:31:06,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:06,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827390590] [2023-02-15 22:31:06,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:06,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:31:06,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:06,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827390590] [2023-02-15 22:31:06,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827390590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:06,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:06,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:31:06,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912988383] [2023-02-15 22:31:06,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:06,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:31:06,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:06,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:31:06,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:06,438 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:06,447 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-02-15 22:31:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:31:06,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 22:31:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:06,449 INFO L225 Difference]: With dead ends: 59 [2023-02-15 22:31:06,450 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 22:31:06,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:06,451 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:06,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:31:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 22:31:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2023-02-15 22:31:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-02-15 22:31:06,459 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 11 [2023-02-15 22:31:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:06,459 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-02-15 22:31:06,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-02-15 22:31:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:31:06,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:06,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:06,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:31:06,462 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2023-02-15 22:31:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:06,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834895179] [2023-02-15 22:31:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:31:06,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:06,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834895179] [2023-02-15 22:31:06,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834895179] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:06,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103147368] [2023-02-15 22:31:06,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:06,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:06,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:31:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:06,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:31:06,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:31:06,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:31:06,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103147368] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:06,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:06,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 22:31:06,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389565539] [2023-02-15 22:31:06,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:06,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:31:06,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:31:06,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:31:06,790 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:06,807 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-02-15 22:31:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:31:06,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 22:31:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:06,808 INFO L225 Difference]: With dead ends: 70 [2023-02-15 22:31:06,808 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 22:31:06,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:31:06,810 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:06,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 206 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:31:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 22:31:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-15 22:31:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-02-15 22:31:06,814 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 16 [2023-02-15 22:31:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:06,815 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-02-15 22:31:06,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-02-15 22:31:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:31:06,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:06,816 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:06,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 22:31:07,021 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 [2023-02-15 22:31:07,022 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:07,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2023-02-15 22:31:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:07,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834300095] [2023-02-15 22:31:07,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 22:31:07,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:07,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834300095] [2023-02-15 22:31:07,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834300095] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:07,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:07,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:31:07,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065230250] [2023-02-15 22:31:07,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:07,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:31:07,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:07,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:31:07,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:31:07,164 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:07,286 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2023-02-15 22:31:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:31:07,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 22:31:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:07,288 INFO L225 Difference]: With dead ends: 92 [2023-02-15 22:31:07,288 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 22:31:07,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:31:07,289 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 158 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:07,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 88 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:31:07,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 22:31:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2023-02-15 22:31:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2023-02-15 22:31:07,296 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 31 [2023-02-15 22:31:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:07,297 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2023-02-15 22:31:07,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2023-02-15 22:31:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:31:07,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:07,301 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:07,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:31:07,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2023-02-15 22:31:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:07,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991417485] [2023-02-15 22:31:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:31:07,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991417485] [2023-02-15 22:31:07,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991417485] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:07,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:07,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:31:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921263203] [2023-02-15 22:31:07,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:07,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:31:07,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:07,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:31:07,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:31:07,615 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:07,752 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2023-02-15 22:31:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:31:07,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 22:31:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:07,754 INFO L225 Difference]: With dead ends: 73 [2023-02-15 22:31:07,754 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 22:31:07,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:31:07,756 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 155 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:07,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 60 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:31:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 22:31:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-15 22:31:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2023-02-15 22:31:07,760 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 31 [2023-02-15 22:31:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:07,761 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2023-02-15 22:31:07,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2023-02-15 22:31:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:31:07,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:07,762 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:07,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:31:07,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:07,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:07,763 INFO L85 PathProgramCache]: Analyzing trace with hash 142544443, now seen corresponding path program 1 times [2023-02-15 22:31:07,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:07,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482009870] [2023-02-15 22:31:07,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:07,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:31:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:08,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482009870] [2023-02-15 22:31:08,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482009870] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:08,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638753216] [2023-02-15 22:31:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:08,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:08,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:08,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:08,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:31:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:08,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 22:31:08,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:08,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:31:08,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:08,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:31:09,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:31:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:31:09,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:31:09,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638753216] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:09,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:09,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-15 22:31:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515218107] [2023-02-15 22:31:09,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:09,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 22:31:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 22:31:09,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2023-02-15 22:31:09,302 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:09,533 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-02-15 22:31:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:31:09,534 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 22:31:09,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:09,534 INFO L225 Difference]: With dead ends: 70 [2023-02-15 22:31:09,534 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 22:31:09,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2023-02-15 22:31:09,535 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 85 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:09,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 315 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:31:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 22:31:09,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-15 22:31:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-02-15 22:31:09,538 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 33 [2023-02-15 22:31:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:09,538 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-02-15 22:31:09,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-02-15 22:31:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:31:09,539 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:09,539 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:09,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:31:09,749 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,SelfDestructingSolverStorable8 [2023-02-15 22:31:09,749 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:09,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2023-02-15 22:31:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:09,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561944669] [2023-02-15 22:31:09,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 22:31:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561944669] [2023-02-15 22:31:10,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561944669] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113035373] [2023-02-15 22:31:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:10,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:10,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:10,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:10,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:31:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:10,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 22:31:10,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:10,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:10,462 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:31:10,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:31:10,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:31:10,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:10,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-02-15 22:31:10,553 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:31:10,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2023-02-15 22:31:10,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:10,719 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:10,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 22:31:10,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:10,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-02-15 22:31:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:10,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:10,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113035373] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:10,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:10,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 25 [2023-02-15 22:31:10,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836941488] [2023-02-15 22:31:10,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:10,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:31:10,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:10,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:31:10,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2023-02-15 22:31:10,967 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:12,006 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-15 22:31:12,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:31:12,007 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 22:31:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:12,007 INFO L225 Difference]: With dead ends: 127 [2023-02-15 22:31:12,007 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 22:31:12,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2023-02-15 22:31:12,008 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 741 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:12,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 314 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:31:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 22:31:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 75. [2023-02-15 22:31:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 74 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2023-02-15 22:31:12,012 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 37 [2023-02-15 22:31:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:12,013 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2023-02-15 22:31:12,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2023-02-15 22:31:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:31:12,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:12,014 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:12,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:31:12,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:12,221 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:12,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:12,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2023-02-15 22:31:12,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:12,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869681961] [2023-02-15 22:31:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:12,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:13,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869681961] [2023-02-15 22:31:13,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869681961] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:13,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012694084] [2023-02-15 22:31:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:13,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:13,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:13,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:13,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:31:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:13,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-15 22:31:13,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:13,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:13,234 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:31:13,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:31:13,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:31:13,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:31:13,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:13,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:31:13,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:13,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-02-15 22:31:13,394 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:31:13,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2023-02-15 22:31:13,405 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:31:13,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 22:31:13,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:13,644 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:13,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2023-02-15 22:31:13,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:13,655 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:13,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2023-02-15 22:31:13,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:13,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 43 [2023-02-15 22:31:13,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:13,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 28 [2023-02-15 22:31:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:13,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:14,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012694084] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:14,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:14,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2023-02-15 22:31:14,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375257791] [2023-02-15 22:31:14,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:14,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 22:31:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:14,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 22:31:14,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2023-02-15 22:31:14,310 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:15,679 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2023-02-15 22:31:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:31:15,679 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 22:31:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:15,680 INFO L225 Difference]: With dead ends: 129 [2023-02-15 22:31:15,680 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 22:31:15,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=534, Invalid=1722, Unknown=0, NotChecked=0, Total=2256 [2023-02-15 22:31:15,681 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1269 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:15,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 189 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:31:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 22:31:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2023-02-15 22:31:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 81 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-02-15 22:31:15,684 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 37 [2023-02-15 22:31:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:15,684 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-02-15 22:31:15,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-02-15 22:31:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:31:15,684 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:15,685 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:15,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 22:31:15,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:15,885 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:15,886 INFO L85 PathProgramCache]: Analyzing trace with hash -494379317, now seen corresponding path program 1 times [2023-02-15 22:31:15,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:15,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758208016] [2023-02-15 22:31:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:15,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:16,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:16,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758208016] [2023-02-15 22:31:16,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758208016] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:16,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722645630] [2023-02-15 22:31:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:16,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:16,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:16,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:31:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:17,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 22:31:17,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:17,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:31:17,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:31:17,299 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:31:17,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-15 22:31:17,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:31:17,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:31:17,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:17,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-02-15 22:31:17,365 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:31:17,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 36 [2023-02-15 22:31:17,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:17,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:31:17,463 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:31:17,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-02-15 22:31:17,473 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:31:17,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 22:31:17,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 22:31:17,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:17,714 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:17,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2023-02-15 22:31:17,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:17,721 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:17,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2023-02-15 22:31:17,729 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:31:17,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 51 [2023-02-15 22:31:17,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:17,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 34 [2023-02-15 22:31:17,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:17,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 33 [2023-02-15 22:31:17,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:31:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:17,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:18,194 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_971) .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_971) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-02-15 22:31:18,237 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))) is different from false [2023-02-15 22:31:19,179 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse25 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse45 (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse45 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse45 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse27 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse37 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse42 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse6 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))) (and (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (let ((.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse23 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse5 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse15 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse20 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse20 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (and .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse1 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse1 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse5 (or .cse6 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse6 (and .cse0 .cse5 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse11 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse13 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse15)) (or .cse6 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse16 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse6 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse18 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse18 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse15))) .cse25 (or .cse6 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse27 (or .cse6 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select .cse28 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse28 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse6 (and .cse25 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) .cse27 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse31 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse33 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse35 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse37)) .cse37 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse38 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse38 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or .cse6 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select .cse40 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse40 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) is different from false [2023-02-15 22:31:19,899 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse44 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse6 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse42 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse7 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse4 (= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))) (and .cse0 (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse1 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (or .cse4 (and .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) .cse6 .cse7 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse12 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse6 .cse7 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select .cse16 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (or (let ((.cse20 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse24 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse37 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse37 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse27 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse35 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse18 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse18 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (and .cse20 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse22 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse22 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse24 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse25 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse25 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse27 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse28 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse28 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse4) .cse20 .cse24 .cse27 (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse4) (or .cse4 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse31 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse4 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse33 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (or .cse4 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) is different from false [2023-02-15 22:31:20,266 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (forall ((v_subst_1 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| v_subst_1 v_ArrVal_964))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_1 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse44 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1)))) (.cse10 (forall ((v_subst_15 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse43 (store |c_#memory_int| v_subst_15 v_ArrVal_964))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_15 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= v_subst_15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_15)))) (.cse13 (forall ((v_subst_14 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse41 (select (store (let ((.cse42 (store |c_#memory_int| v_subst_14 v_ArrVal_964))) (store .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_14 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse41 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse41 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_14)))) (.cse1 (= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))) (and .cse0 (or .cse1 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_22 Int)) (let ((.cse3 (select (store (let ((.cse4 (store |c_#memory_int| v_subst_22 v_ArrVal_964))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_22 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse3 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22) (= v_subst_22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (or .cse1 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_19 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| v_subst_19 v_ArrVal_964))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_19 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse5 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse5 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_19))))) (or .cse1 (and .cse0 (forall ((v_subst_18 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse7 (store |c_#memory_int| v_subst_18 v_ArrVal_964))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_18 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_18))) (forall ((v_subst_16 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int| v_subst_16 v_ArrVal_964))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_16 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_16))) .cse10 (forall ((v_subst_17 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| v_subst_17 v_ArrVal_964))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_17 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_17))) .cse13 (forall ((v_subst_13 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| v_subst_13 v_ArrVal_964))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_13 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_13))))) .cse10 (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_21 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_21) (= (select (select (store (let ((.cse16 (store |c_#memory_int| v_subst_21 v_ArrVal_964))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_21 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse1) .cse13 (or (let ((.cse17 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int| v_subst_3 v_ArrVal_964))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_3 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse37 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse37 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse23 (forall ((v_subst_5 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse36 (store |c_#memory_int| v_subst_5 v_ArrVal_964))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_5 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse26 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_2 Int)) (or (= v_subst_2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| v_subst_2 v_ArrVal_964))) (store .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_2 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse34 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse34 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (and .cse17 (or (and .cse17 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_10 Int)) (= (select (select (store (let ((.cse18 (store |c_#memory_int| v_subst_10 v_ArrVal_964))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_10 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_9 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| v_subst_9 v_ArrVal_964))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_9 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse19 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_7 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| v_subst_7 v_ArrVal_964))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_7 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse21 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse23 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_8 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int| v_subst_8 v_ArrVal_964))) (store .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_8 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse24 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse26) .cse1) (or .cse1 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int| v_subst_6 v_ArrVal_964))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_6 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse27 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse27 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (or .cse1 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_11 Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| v_subst_11 v_ArrVal_964))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_11 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse29 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse29 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_4 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| v_subst_4 v_ArrVal_964))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_4 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse31 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse23 (or (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_12 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse33 (store |c_#memory_int| v_subst_12 v_ArrVal_964))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_12 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse1) .cse26)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (forall ((v_subst_20 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_20) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| v_subst_20 v_ArrVal_964))) (store .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_20 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse39 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse39 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))))) is different from false [2023-02-15 22:31:20,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:20,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2023-02-15 22:31:20,419 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:20,420 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:20,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:20,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 65 [2023-02-15 22:31:20,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:31:20,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:20,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 92 [2023-02-15 22:31:20,491 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 22:31:20,497 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 22:31:20,502 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 22:31:20,507 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 22:31:20,513 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 22:31:20,519 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 22:31:20,524 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 22:31:20,531 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 22:31:20,538 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 22:31:20,543 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 22:31:20,549 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 22:31:20,556 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 22:31:20,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:20,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2023-02-15 22:31:20,566 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:20,571 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:31:20,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 143 [2023-02-15 22:31:20,575 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:20,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2023-02-15 22:31:20,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-02-15 22:31:20,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 98 [2023-02-15 22:31:20,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-02-15 22:31:20,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:20,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2023-02-15 22:31:20,605 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:20,611 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:31:20,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 592 treesize of output 569 [2023-02-15 22:31:20,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:20,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 534 treesize of output 502 [2023-02-15 22:31:20,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 240 [2023-02-15 22:31:20,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 486 treesize of output 470 [2023-02-15 22:31:20,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 406 [2023-02-15 22:31:20,703 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:20,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 22:31:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 18 not checked. [2023-02-15 22:31:20,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722645630] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:20,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:20,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 47 [2023-02-15 22:31:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606334367] [2023-02-15 22:31:20,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:20,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 22:31:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:20,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 22:31:20,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1593, Unknown=13, NotChecked=420, Total=2162 [2023-02-15 22:31:20,808 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:29,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:29,732 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2023-02-15 22:31:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 22:31:29,733 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 22:31:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:29,734 INFO L225 Difference]: With dead ends: 124 [2023-02-15 22:31:29,734 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 22:31:29,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=663, Invalid=3766, Unknown=13, NotChecked=670, Total=5112 [2023-02-15 22:31:29,735 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 567 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 503 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:29,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 290 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1020 Invalid, 0 Unknown, 503 Unchecked, 0.9s Time] [2023-02-15 22:31:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 22:31:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 85. [2023-02-15 22:31:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 84 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2023-02-15 22:31:29,738 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 39 [2023-02-15 22:31:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:29,738 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2023-02-15 22:31:29,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2023-02-15 22:31:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:31:29,739 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:29,739 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:29,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:31:29,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 22:31:29,951 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1852999412, now seen corresponding path program 1 times [2023-02-15 22:31:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:29,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103448053] [2023-02-15 22:31:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:30,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:30,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103448053] [2023-02-15 22:31:30,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103448053] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:30,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419014089] [2023-02-15 22:31:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:30,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:30,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:30,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:30,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:31:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:30,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 22:31:30,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:30,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:30,546 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:30,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:31:30,564 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:30,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:31:30,625 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 22:31:30,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 22:31:30,740 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-02-15 22:31:30,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2023-02-15 22:31:30,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:31:30,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:30,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2023-02-15 22:31:30,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-02-15 22:31:31,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 22:31:31,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:31,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-02-15 22:31:31,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:31,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 22:31:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:31:31,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:31,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:31,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-02-15 22:31:31,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-02-15 22:31:31,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-15 22:31:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:31:31,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419014089] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:31,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:31,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 38 [2023-02-15 22:31:31,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953814969] [2023-02-15 22:31:31,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:31,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 22:31:31,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 22:31:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1239, Unknown=1, NotChecked=0, Total=1406 [2023-02-15 22:31:31,558 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:32,676 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2023-02-15 22:31:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 22:31:32,682 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-15 22:31:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:32,682 INFO L225 Difference]: With dead ends: 106 [2023-02-15 22:31:32,682 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 22:31:32,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=2449, Unknown=1, NotChecked=0, Total=3080 [2023-02-15 22:31:32,685 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 341 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:32,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 417 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:31:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 22:31:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2023-02-15 22:31:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-02-15 22:31:32,688 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 40 [2023-02-15 22:31:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:32,689 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-02-15 22:31:32,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-02-15 22:31:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:31:32,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:32,695 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:32,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 22:31:32,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:32,897 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:32,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:32,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2023-02-15 22:31:32,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:32,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963198089] [2023-02-15 22:31:32,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:32,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:31:34,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:34,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963198089] [2023-02-15 22:31:34,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963198089] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:34,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511126458] [2023-02-15 22:31:34,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:31:34,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:34,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:34,402 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:34,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:31:34,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:31:34,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:31:34,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 102 conjunts are in the unsatisfiable core [2023-02-15 22:31:34,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:34,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:34,592 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:34,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:31:34,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:31:34,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:31:34,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:34,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:31:34,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:34,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-02-15 22:31:34,759 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:31:34,759 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 22:31:34,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:34,840 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:31:34,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2023-02-15 22:31:34,849 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 22:31:34,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 22:31:34,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:34,945 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:34,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 66 [2023-02-15 22:31:34,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:34,964 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:31:34,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 22:31:35,118 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-15 22:31:35,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 80 [2023-02-15 22:31:35,138 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:31:35,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 22:31:35,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:35,689 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 22:31:35,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 115 [2023-02-15 22:31:35,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:35,700 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 22:31:35,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 151 [2023-02-15 22:31:36,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:31:36,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:36,247 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 22:31:36,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 76 [2023-02-15 22:31:36,273 INFO L321 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2023-02-15 22:31:36,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 100 [2023-02-15 22:31:36,330 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:36,344 INFO L321 Elim1Store]: treesize reduction 37, result has 35.1 percent of original size [2023-02-15 22:31:36,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 118 treesize of output 83 [2023-02-15 22:31:36,374 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-15 22:31:36,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 59 [2023-02-15 22:31:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:31:36,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:38,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-02-15 22:31:39,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:39,219 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:39,220 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:31:39,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511126458] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:39,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:39,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 53 [2023-02-15 22:31:39,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164138846] [2023-02-15 22:31:39,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:39,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 22:31:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:39,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 22:31:39,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2023-02-15 22:31:39,577 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 54 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 54 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:43,191 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse29 (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse17 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse28 (= .cse29 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse30 (select (select |c_#memory_$Pointer$.base| .cse29) 0)) (.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse8 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse12 (not (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse13 (select .cse10 0)) (.cse19 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) (.cse6 (select .cse18 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse25 (= (select |c_#valid| .cse30) 1)) (.cse26 (not (= .cse29 .cse30))) (.cse23 (= .cse30 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse24 (not .cse28)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse2 (select .cse17 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse22 (= (select (select |c_#memory_$Pointer$.offset| .cse29) 0) 0))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= 1 .cse1) (or .cse0 (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse3 (or .cse0 (let ((.cse5 (= .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse4) 1) .cse5)) (or (= (select (select |c_#memory_$Pointer$.offset| .cse6) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse5)))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (and (or (= (select .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse8) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse9) 1) .cse8)))) (or (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) (forall ((v_ArrVal_1353 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1353)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1339 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| v_ArrVal_1339) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1339 Int)) (let ((.cse11 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| v_ArrVal_1339) .cse11) 1) (= .cse11 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|))))))) .cse12) (or (= (select |c_#valid| .cse13) 1) .cse8) (= .cse1 1) (or (= (select .cse7 0) 0) .cse8) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (let ((.cse15 (store .cse18 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (forall ((v_ArrVal_1354 Int)) (let ((.cse14 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse15 .cse16 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse14 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse14) 1)))) (or (forall ((v_ArrVal_1354 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse15 .cse16 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_1353 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store .cse17 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse16 v_ArrVal_1353)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (not (<= (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) .cse19)) .cse12) (or (not (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1339 Int)) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse20 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| v_ArrVal_1339) .cse20) 1)))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| Int)) (or (forall ((v_ArrVal_1353 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1353)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0)) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1339 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| v_ArrVal_1339) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|))))) (let ((.cse21 (= .cse13 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (and .cse21 (exists ((v_arrayElimCell_85 Int)) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_arrayElimCell_85)) (= (select |c_#valid| v_arrayElimCell_85) 1)))) (and .cse21 (exists ((v_arrayElimIndex_3 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_3) 0) 0) (= (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_3) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= v_arrayElimIndex_3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) (and .cse22 .cse23 .cse24) (and .cse25 .cse26 .cse22 (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) (= (select |c_#valid| .cse6) 1) (<= .cse19 8) (or (not (<= (+ .cse2 8) (select |c_#length| .cse6))) (not (<= 0 .cse2)) (and (or (forall ((v_ArrVal_1353 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse17 .cse16 v_ArrVal_1353)) .cse6) .cse2) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (forall ((v_ArrVal_1354 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse18 .cse16 v_ArrVal_1354)) .cse6) .cse2)) 1))) (forall ((v_ArrVal_1354 Int)) (let ((.cse27 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse18 .cse16 v_ArrVal_1354)) .cse6) .cse2))) (or (= .cse27 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse27) 1)))))) (or (and .cse28 (exists ((v_arrayElimCell_85 Int)) (and (not (= .cse29 v_arrayElimCell_85)) (= (select |c_#valid| v_arrayElimCell_85) 1)))) (and .cse25 .cse26) (and .cse23 .cse24)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (or .cse0 .cse3) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (or .cse0 (= .cse2 0)) .cse22))))) is different from false [2023-02-15 22:31:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:46,921 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2023-02-15 22:31:46,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-15 22:31:46,921 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 54 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 22:31:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:46,923 INFO L225 Difference]: With dead ends: 158 [2023-02-15 22:31:46,923 INFO L226 Difference]: Without dead ends: 158 [2023-02-15 22:31:46,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=975, Invalid=8340, Unknown=1, NotChecked=190, Total=9506 [2023-02-15 22:31:46,925 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 475 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:46,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 291 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1414 Invalid, 0 Unknown, 1 Unchecked, 1.2s Time] [2023-02-15 22:31:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-15 22:31:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 84. [2023-02-15 22:31:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 83 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2023-02-15 22:31:46,947 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 43 [2023-02-15 22:31:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:46,948 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-02-15 22:31:46,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 54 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:31:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2023-02-15 22:31:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:31:46,950 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:46,950 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:46,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:31:47,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:47,169 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:31:47,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728483, now seen corresponding path program 2 times [2023-02-15 22:31:47,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:47,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496228366] [2023-02-15 22:31:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:47,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:31:48,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:48,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496228366] [2023-02-15 22:31:48,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496228366] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:48,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687789949] [2023-02-15 22:31:48,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:31:48,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:48,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:48,570 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:48,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:31:48,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:31:48,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:31:48,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-15 22:31:48,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:48,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:48,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:48,827 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:31:48,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:31:48,831 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 14 [2023-02-15 22:31:48,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:31:48,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:31:48,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:48,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:31:48,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:48,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-02-15 22:31:48,990 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:31:48,991 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 22:31:49,073 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:31:49,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2023-02-15 22:31:49,079 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 22:31:49,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 22:31:49,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:49,166 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:31:49,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 22:31:49,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:49,172 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:49,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 62 [2023-02-15 22:31:49,350 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-15 22:31:49,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 76 [2023-02-15 22:31:49,368 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:31:49,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 22:31:50,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:50,029 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 22:31:50,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 161 [2023-02-15 22:31:50,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:50,036 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 22:31:50,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 117 [2023-02-15 22:31:50,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:50,457 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:50,468 INFO L321 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2023-02-15 22:31:50,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 100 [2023-02-15 22:31:50,492 INFO L321 Elim1Store]: treesize reduction 70, result has 32.0 percent of original size [2023-02-15 22:31:50,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 100 treesize of output 94 [2023-02-15 22:31:50,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:50,599 INFO L321 Elim1Store]: treesize reduction 37, result has 35.1 percent of original size [2023-02-15 22:31:50,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 118 treesize of output 83 [2023-02-15 22:31:50,615 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-15 22:31:50,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 56 [2023-02-15 22:31:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:31:50,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:32:27,520 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:27,524 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:27,693 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:27,696 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:36,820 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:32:43,106 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:32:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:32:43,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687789949] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:32:43,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:32:43,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 55 [2023-02-15 22:32:43,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589070951] [2023-02-15 22:32:43,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:32:43,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-15 22:32:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:32:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-15 22:32:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2889, Unknown=3, NotChecked=0, Total=3080 [2023-02-15 22:32:43,236 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 56 states, 55 states have (on average 2.2545454545454544) internal successors, (124), 56 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:33:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:33:00,747 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2023-02-15 22:33:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-02-15 22:33:00,748 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.2545454545454544) internal successors, (124), 56 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 22:33:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:33:00,748 INFO L225 Difference]: With dead ends: 206 [2023-02-15 22:33:00,748 INFO L226 Difference]: Without dead ends: 206 [2023-02-15 22:33:00,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2598 ImplicationChecksByTransitivity, 68.2s TimeCoverageRelationStatistics Valid=2250, Invalid=9737, Unknown=3, NotChecked=0, Total=11990 [2023-02-15 22:33:00,751 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 2596 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2596 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:33:00,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2596 Valid, 424 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-15 22:33:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-15 22:33:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 91. [2023-02-15 22:33:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 90 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:33:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2023-02-15 22:33:00,754 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 43 [2023-02-15 22:33:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:33:00,754 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2023-02-15 22:33:00,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.2545454545454544) internal successors, (124), 56 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:33:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2023-02-15 22:33:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:33:00,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:33:00,754 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:33:00,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:33:00,955 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,SelfDestructingSolverStorable14 [2023-02-15 22:33:00,955 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:33:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:33:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash 972990721, now seen corresponding path program 1 times [2023-02-15 22:33:00,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:33:00,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896700435] [2023-02-15 22:33:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:33:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-15 22:33:01,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:33:01,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896700435] [2023-02-15 22:33:01,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896700435] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:33:01,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884431705] [2023-02-15 22:33:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:01,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:33:01,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:33:01,043 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:33:01,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:33:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:01,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:33:01,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:33:01,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:33:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 22:33:01,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:33:01,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884431705] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:33:01,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:33:01,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2023-02-15 22:33:01,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126169712] [2023-02-15 22:33:01,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:33:01,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:33:01,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:33:01,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:33:01,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:33:01,249 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:33:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:33:01,389 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2023-02-15 22:33:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:33:01,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-15 22:33:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:33:01,390 INFO L225 Difference]: With dead ends: 136 [2023-02-15 22:33:01,390 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 22:33:01,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:33:01,391 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 213 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:33:01,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 122 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:33:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 22:33:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 96. [2023-02-15 22:33:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:33:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2023-02-15 22:33:01,392 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 44 [2023-02-15 22:33:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:33:01,393 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2023-02-15 22:33:01,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:33:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2023-02-15 22:33:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:33:01,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:33:01,393 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:33:01,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 22:33:01,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 22:33:01,601 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:33:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:33:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash 972990722, now seen corresponding path program 1 times [2023-02-15 22:33:01,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:33:01,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857652045] [2023-02-15 22:33:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:33:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 22:33:01,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:33:01,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857652045] [2023-02-15 22:33:01,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857652045] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:33:01,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221999379] [2023-02-15 22:33:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:01,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:33:01,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:33:01,773 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:33:01,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 22:33:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:01,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:33:01,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:33:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-15 22:33:02,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:33:02,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:33:02,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2023-02-15 22:33:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-15 22:33:02,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221999379] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:33:02,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:33:02,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2023-02-15 22:33:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861210747] [2023-02-15 22:33:02,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:33:02,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 22:33:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:33:02,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 22:33:02,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:33:02,146 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:33:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:33:02,468 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2023-02-15 22:33:02,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:33:02,468 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-15 22:33:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:33:02,469 INFO L225 Difference]: With dead ends: 96 [2023-02-15 22:33:02,469 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 22:33:02,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2023-02-15 22:33:02,469 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 398 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:33:02,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 66 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:33:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 22:33:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2023-02-15 22:33:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:33:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2023-02-15 22:33:02,471 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 44 [2023-02-15 22:33:02,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:33:02,471 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2023-02-15 22:33:02,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:33:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2023-02-15 22:33:02,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:33:02,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:33:02,472 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:33:02,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:33:02,679 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,SelfDestructingSolverStorable16 [2023-02-15 22:33:02,679 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 22:33:02,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:33:02,680 INFO L85 PathProgramCache]: Analyzing trace with hash 97977179, now seen corresponding path program 2 times [2023-02-15 22:33:02,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:33:02,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360882237] [2023-02-15 22:33:02,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:02,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:33:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:33:05,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:33:05,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360882237] [2023-02-15 22:33:05,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360882237] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:33:05,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803337497] [2023-02-15 22:33:05,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:33:05,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:33:05,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:33:05,026 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:33:05,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 22:33:05,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:33:05,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:33:05,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 116 conjunts are in the unsatisfiable core [2023-02-15 22:33:05,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:33:05,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:33:05,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:33:05,428 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:33:05,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:33:05,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:33:05,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:33:05,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 22:33:05,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:05,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-02-15 22:33:05,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 22:33:05,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:05,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:33:05,688 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:33:05,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-02-15 22:33:05,694 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 22:33:05,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 22:33:05,705 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:33:05,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 22:33:05,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:33:05,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:05,804 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:33:05,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 70 [2023-02-15 22:33:05,823 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2023-02-15 22:33:05,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 120 [2023-02-15 22:33:05,849 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 22:33:05,908 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 22:33:05,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:05,950 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:33:05,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 22:33:06,198 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-15 22:33:06,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 84 [2023-02-15 22:33:06,206 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:33:06,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2023-02-15 22:33:06,222 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:33:06,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 22:33:07,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:07,047 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 22:33:07,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 155 [2023-02-15 22:33:07,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:07,055 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 22:33:07,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 119 [2023-02-15 22:33:07,082 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2023-02-15 22:33:07,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 178 [2023-02-15 22:33:07,182 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 22:33:07,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:07,993 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 22:33:07,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 78 [2023-02-15 22:33:08,005 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 22:33:08,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2023-02-15 22:33:08,058 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-02-15 22:33:08,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 82 [2023-02-15 22:33:08,202 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:33:08,219 INFO L321 Elim1Store]: treesize reduction 37, result has 35.1 percent of original size [2023-02-15 22:33:08,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 120 treesize of output 85 [2023-02-15 22:33:08,254 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-15 22:33:08,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 58 [2023-02-15 22:33:08,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:33:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:33:08,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:33:20,717 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2123 Int) (v_ArrVal_2126 Int) (v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_2127 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse5 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse7 .cse4 v_ArrVal_2127)) .cse0) .cse5))) (or (= (select (select (store (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_2123)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2128) .cse0 v_ArrVal_2134) .cse1) (+ (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2126)) .cse0) .cse5) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2123 Int) (v_ArrVal_2126 Int) (v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_2127 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (.cse13 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse11 (select .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse12 (select .cse14 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse8 (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse14 .cse4 v_ArrVal_2126)) .cse9) .cse12))) (or (= .cse8 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_2123)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2128) .cse9 v_ArrVal_2134) (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse11 .cse4 v_ArrVal_2127)) .cse9) .cse12)) (+ .cse8 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) is different from false [2023-02-15 22:33:32,144 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2123 Int) (v_ArrVal_2115 Int) (v_ArrVal_2126 Int) (v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_2116 Int) (v_ArrVal_2127 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5 v_ArrVal_2115)))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse3 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse5 v_ArrVal_2116)))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (let ((.cse4 (select .cse3 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse8 (select .cse7 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse6 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse5 v_ArrVal_2127)) .cse1) .cse6))) (or (= (select (select (store (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2117))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_2123))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2128) .cse1 v_ArrVal_2134) .cse2) (+ (select (select (store .cse3 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2126)) .cse1) .cse6) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse2 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2123 Int) (v_ArrVal_2115 Int) (v_ArrVal_2126 Int) (v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_2116 Int) (v_ArrVal_2127 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse13 (let ((.cse20 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5 v_ArrVal_2115)))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse17 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse5 v_ArrVal_2116)))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (let ((.cse18 (select .cse17 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse14 (select .cse13 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse15 (select .cse18 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse16 (select (select (store .cse17 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse18 .cse5 v_ArrVal_2126)) .cse12) .cse15))) (or (= (select (select (store (store (let ((.cse11 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2117))) (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_2123))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2128) .cse12 v_ArrVal_2134) (select (select (store .cse13 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse14 .cse5 v_ArrVal_2127)) .cse12) .cse15)) (+ .cse16 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse16 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))))) is different from false [2023-02-15 22:33:32,337 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2123 Int) (v_ArrVal_2115 Int) (v_ArrVal_2126 Int) (v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_2116 Int) (v_ArrVal_2127 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse6 (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_2115)))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse3 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_2116)))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse4 (select .cse3 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse7 (select .cse6 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse7 0)) (.cse5 (select .cse4 0))) (let ((.cse2 (select (select (store .cse6 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse7 4 v_ArrVal_2127)) .cse1) .cse5))) (or (= (select (select (store (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2117))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_2123))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2128) .cse1 v_ArrVal_2134) .cse2) (+ (select (select (store .cse3 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse4 4 v_ArrVal_2126)) .cse1) .cse5) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse2 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2123 Int) (v_ArrVal_2115 Int) (v_ArrVal_2126 Int) (v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_2116 Int) (v_ArrVal_2127 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse12 (let ((.cse19 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_2115)))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse16 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_2116)))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse17 (select .cse16 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse13 (select .cse12 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse11 (select .cse13 0)) (.cse14 (select .cse17 0))) (let ((.cse15 (select (select (store .cse16 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse17 4 v_ArrVal_2126)) .cse11) .cse14))) (or (= (select (select (store (store (let ((.cse10 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2117))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_2123))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2128) .cse11 v_ArrVal_2134) (select (select (store .cse12 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 4 v_ArrVal_2127)) .cse11) .cse14)) (+ .cse15 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse15 0)))))))) is different from false [2023-02-15 22:33:32,826 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_subst_24 Int) (v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2123 Int) (v_ArrVal_2115 Int) (v_ArrVal_2126 Int) (v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_2116 Int) (v_ArrVal_2127 Int)) (let ((.cse2 (let ((.cse9 (store |c_#memory_$Pointer$.base| v_subst_24 (store (store (select |c_#memory_$Pointer$.base| v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_2115)))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_24)))) (.cse6 (let ((.cse8 (store |c_#memory_$Pointer$.offset| v_subst_24 (store (store (select |c_#memory_$Pointer$.offset| v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_2116)))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse7 (select .cse6 v_subst_24)) (.cse3 (select .cse2 v_subst_24))) (let ((.cse1 (select .cse3 0)) (.cse4 (select .cse7 0))) (let ((.cse5 (select (select (store .cse6 v_subst_24 (store .cse7 4 v_ArrVal_2126)) .cse1) .cse4))) (or (= (select (select (store (store (let ((.cse0 (store |c_#memory_int| v_subst_24 v_ArrVal_2117))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_2123))) v_subst_24 v_ArrVal_2128) .cse1 v_ArrVal_2134) (select (select (store .cse2 v_subst_24 (store .cse3 4 v_ArrVal_2127)) .cse1) .cse4)) (+ .cse5 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse5 0))))))) (forall ((v_subst_23 Int) (v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2123 Int) (v_ArrVal_2115 Int) (v_ArrVal_2126 Int) (v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_2116 Int) (v_ArrVal_2127 Int)) (let ((.cse16 (let ((.cse19 (store |c_#memory_$Pointer$.base| v_subst_23 (store (store (select |c_#memory_$Pointer$.base| v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_2115)))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_23)))) (.cse13 (let ((.cse18 (store |c_#memory_$Pointer$.offset| v_subst_23 (store (store (select |c_#memory_$Pointer$.offset| v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_2116)))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse14 (select .cse13 v_subst_23)) (.cse17 (select .cse16 v_subst_23))) (let ((.cse12 (select .cse17 0)) (.cse15 (select .cse14 0))) (let ((.cse10 (select (select (store .cse16 v_subst_23 (store .cse17 4 v_ArrVal_2127)) .cse12) .cse15))) (or (= .cse10 v_subst_23) (= (select (select (store (store (let ((.cse11 (store |c_#memory_int| v_subst_23 v_ArrVal_2117))) (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_2123))) v_subst_23 v_ArrVal_2128) .cse12 v_ArrVal_2134) .cse10) (+ (select (select (store .cse13 v_subst_23 (store .cse14 4 v_ArrVal_2126)) .cse12) .cse15) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) is different from false [2023-02-15 22:33:32,916 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2107 (Array Int Int)) (v_subst_23 Int) (v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_2123 Int) (v_ArrVal_2115 Int) (v_ArrVal_2126 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int) (v_ArrVal_2127 Int) (v_ArrVal_2108 Int)) (let ((.cse6 (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse14 .cse11 v_ArrVal_2106)))) (store .cse13 v_subst_23 (store (store (select .cse13 v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_2115))))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_23)))) (.cse3 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse10 .cse11 v_ArrVal_2108)))) (store .cse9 v_subst_23 (store (store (select .cse9 v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_2116))))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse4 (select .cse3 v_subst_23)) (.cse7 (select .cse6 v_subst_23))) (let ((.cse2 (select .cse7 0)) (.cse5 (select .cse4 0))) (let ((.cse0 (select (select (store .cse6 v_subst_23 (store .cse7 4 v_ArrVal_2127)) .cse2) .cse5))) (or (= .cse0 v_subst_23) (= (select (select (store (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2107) v_subst_23 v_ArrVal_2117))) (store .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_2123))) v_subst_23 v_ArrVal_2128) .cse2 v_ArrVal_2134) .cse0) (+ (select (select (store .cse3 v_subst_23 (store .cse4 4 v_ArrVal_2126)) .cse2) .cse5) 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (forall ((v_subst_24 Int) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2117 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_2123 Int) (v_ArrVal_2115 Int) (v_ArrVal_2126 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int) (v_ArrVal_2127 Int) (v_ArrVal_2108 Int)) (let ((.cse17 (let ((.cse25 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse14 .cse11 v_ArrVal_2106)))) (store .cse26 v_subst_24 (store (store (select .cse26 v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_2115))))) (store .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_24)))) (.cse21 (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse10 .cse11 v_ArrVal_2108)))) (store .cse24 v_subst_24 (store (store (select .cse24 v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_2116))))) (store .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse22 (select .cse21 v_subst_24)) (.cse18 (select .cse17 v_subst_24))) (let ((.cse16 (select .cse18 0)) (.cse19 (select .cse22 0))) (let ((.cse20 (select (select (store .cse21 v_subst_24 (store .cse22 4 v_ArrVal_2126)) .cse16) .cse19))) (or (= (select (select (store (store (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2107) v_subst_24 v_ArrVal_2117))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_2123))) v_subst_24 v_ArrVal_2128) .cse16 v_ArrVal_2134) (select (select (store .cse17 v_subst_24 (store .cse18 4 v_ArrVal_2127)) .cse16) .cse19)) (+ .cse20 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse20 0))))))))) is different from false [2023-02-15 22:33:33,624 INFO L321 Elim1Store]: treesize reduction 2665, result has 3.1 percent of original size [2023-02-15 22:33:33,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 7973398 treesize of output 7950361 [2023-02-15 22:33:36,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:33:36,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 9883045 treesize of output 8916713 [2023-02-15 22:33:39,229 INFO L321 Elim1Store]: treesize reduction 351, result has 27.0 percent of original size [2023-02-15 22:33:39,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 500336754 treesize of output 498239423